Linked Data Explorer
Turtle
N-Triple
JSON-LD
RDF/XML
HTML
Contact Us
Home
http://worldcat.org/entity/work/id/25101134
On the complexity of finding the chromatic number of a recursive graph II : the unbounded case
Open All
Close All
type
http://www.w3.org/1999/02/22-rdf-syntax-ns#type
http://schema.org/CreativeWork
about
http://schema.org/about
http://id.worldcat.org/fast/1091984
http://id.worldcat.org/fast/946587
http://id.loc.gov/authorities/subjects/sh85056472
http://id.loc.gov/authorities/subjects/sh85112014
contributor
http://schema.org/contributor
http://worldcat.org/entity/person/id/2628132236
creator
http://schema.org/creator
http://worldcat.org/entity/person/id/2632598734
name
http://schema.org/name
"
On the complexity of finding the chromatic number of a recursive graph II : the unbounded case
"
@
en
workExample
http://schema.org/workExample
http://www.worldcat.org/oclc/23670705