skip to content
On the complexity of finding the chromatic number of a recursive graph II : the unbounded case Preview this item
ClosePreview this item
Checking...

On the complexity of finding the chromatic number of a recursive graph II : the unbounded case

Author: Richard Beigel; William I Gasarch
Publisher: College Park, Md. : University of Maryland, [1988?]
Series: Computer science technical report series (College Park, Md.), TR-2036.
Edition/Format:   Print book : State or province government publication : English
Database:WorldCat
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Material Type: Government publication, State or province government publication
Document Type: Book
All Authors / Contributors: Richard Beigel; William I Gasarch
OCLC Number: 23670705
Description: 25 pages ; 28 cm.
Series Title: Computer science technical report series (College Park, Md.), TR-2036.
Responsibility: by Richard Beigel, William I. Gasarch.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/23670705> # On the complexity of finding the chromatic number of a recursive graph II : the unbounded case
    a schema:CreativeWork, schema:Book ;
    library:oclcnum "23670705" ;
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/mdu> ;
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/25101134#Place/college_park_md> ; # College Park, Md.
    rdfs:comment "Unknown 'gen' value: sgp" ;
    schema:about <http://id.worldcat.org/fast/946587> ; # Graph theory--Data processing
    schema:about <http://id.worldcat.org/fast/1091984> ; # Recursive functions
    schema:about <http://id.loc.gov/authorities/subjects/sh85056472> ; # Graph theory--Data processing
    schema:bookFormat bgn:PrintBook ;
    schema:contributor <http://viaf.org/viaf/32836356> ; # William I. Gasarch
    schema:creator <http://viaf.org/viaf/91642547> ; # Richard Beigel
    schema:datePublished "1988" ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/25101134> ;
    schema:genre "Government publication"@en ;
    schema:inLanguage "en" ;
    schema:isPartOf <http://experiment.worldcat.org/entity/work/data/25101134#Series/computer_science_technical_report_series_college_park_md> ; # Computer science technical report series (College Park, Md.) ;
    schema:isPartOf <http://experiment.worldcat.org/entity/work/data/25101134#Series/computer_science_technical_report_series> ; # Computer science technical report series ;
    schema:name "On the complexity of finding the chromatic number of a recursive graph II : the unbounded case"@en ;
    schema:productID "23670705" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/23670705#PublicationEvent/college_park_md_university_of_maryland_1988> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/25101134#Agent/university_of_maryland> ; # University of Maryland
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/23670705> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/25101134#Agent/university_of_maryland> # University of Maryland
    a bgn:Agent ;
    schema:name "University of Maryland" ;
    .

<http://experiment.worldcat.org/entity/work/data/25101134#Place/college_park_md> # College Park, Md.
    a schema:Place ;
    schema:name "College Park, Md." ;
    .

<http://experiment.worldcat.org/entity/work/data/25101134#Series/computer_science_technical_report_series> # Computer science technical report series ;
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/23670705> ; # On the complexity of finding the chromatic number of a recursive graph II : the unbounded case
    schema:name "Computer science technical report series ;" ;
    .

<http://experiment.worldcat.org/entity/work/data/25101134#Series/computer_science_technical_report_series_college_park_md> # Computer science technical report series (College Park, Md.) ;
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/23670705> ; # On the complexity of finding the chromatic number of a recursive graph II : the unbounded case
    schema:name "Computer science technical report series (College Park, Md.) ;" ;
    .

<http://id.loc.gov/authorities/subjects/sh85056472> # Graph theory--Data processing
    a schema:Intangible ;
    schema:name "Graph theory--Data processing"@en ;
    .

<http://id.worldcat.org/fast/1091984> # Recursive functions
    a schema:Intangible ;
    schema:name "Recursive functions"@en ;
    .

<http://id.worldcat.org/fast/946587> # Graph theory--Data processing
    a schema:Intangible ;
    schema:name "Graph theory--Data processing"@en ;
    .

<http://viaf.org/viaf/32836356> # William I. Gasarch
    a schema:Person ;
    schema:familyName "Gasarch" ;
    schema:givenName "William I." ;
    schema:name "William I. Gasarch" ;
    .

<http://viaf.org/viaf/91642547> # Richard Beigel
    a schema:Person ;
    schema:familyName "Beigel" ;
    schema:givenName "Richard" ;
    schema:name "Richard Beigel" ;
    .

<http://www.worldcat.org/title/-/oclc/23670705>
    a genont:InformationResource, genont:ContentTypeGenericResource ;
    schema:about <http://www.worldcat.org/oclc/23670705> ; # On the complexity of finding the chromatic number of a recursive graph II : the unbounded case
    schema:dateModified "2015-03-14" ;
    void:inDataset <http://purl.oclc.org/dataset/WorldCat> ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.