Electronic Resource
Springer
Journal of combinatorial optimization
2 (1998), S. 117-188
ISSN:
1573-2886
Keywords:
graph coloring
;
chromatic number
;
minor
;
subdivision
;
polynomial time algorithm
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract A fully odd K4 is a subdivision of K4 such that each of the six edges of the K4 is subdivided into a path of odd length. In 1974, Toft conjectured that every graph containing no fully odd K4 can be vertex-colored with three colors. The purpose of this paper is to prove Toft's conjecture.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1023/A:1009784115916
Permalink
|
Location |
Call Number |
Expected |
Availability |