Proof of Toft's Conjecture: Every Graph Containing No Fully Odd K4 Is 3-Colorable. | D2R Server publishing the DBLP Bibliography Database, hosted at L3S Research Center

Property	Value
dcterms:bibliographicCitation	<http://dblp.uni-trier.de/rec/bibtex/conf/cocoon/Zang98>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Wenan_Zang>
foaf:homepage	<http://dx.doi.org/doi.org%2F10.1007%2F3-540-68535-9%5F30>
foaf:homepage	<https://doi.org/10.1007/3-540-68535-9_30>
dc:identifier	DBLP conf/cocoon/Zang98 (xsd:string)
dc:identifier	DOI doi.org%2F10.1007%2F3-540-68535-9%5F30 (xsd:string)
dcterms:issued	1998 (xsd:gYear)
rdfs:label	Proof of Toft's Conjecture: Every Graph Containing No Fully Odd K4 Is 3-Colorable. (xsd:string)
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Wenan_Zang>
swrc:pages	261-268 (xsd:string)
dcterms:partOf	<https://dblp.l3s.de/d2r/resource/publications/conf/cocoon/1998>
owl:sameAs	<http://bibsonomy.org/uri/bibtexkey/conf/cocoon/Zang98/dblp>
owl:sameAs	<http://dblp.rkbexplorer.com/id/conf/cocoon/Zang98>
rdfs:seeAlso	<http://dblp.uni-trier.de/db/conf/cocoon/cocoon98.html#Zang98>
rdfs:seeAlso	<https://doi.org/10.1007/3-540-68535-9_30>
swrc:series	<https://dblp.l3s.de/d2r/resource/conferences/cocoon>
dc:title	Proof of Toft's Conjecture: Every Graph Containing No Fully Odd K4 Is 3-Colorable. (xsd:string)
dc:type	<http://purl.org/dc/dcmitype/Text>
rdf:type	swrc:InProceedings
rdf:type	foaf:Document