Proof of Toft's conjecture: Every graph containing no fully odd K4 is 3-colorable

Journal of Combinatorial Optimization

Volumn 2, Issue 2, 1998, Pages 117-188

  Zang, Wenan ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Chromatic number; Graph coloring; Minor; Polynomial time algorithm; Subdivision

Indexed keywords

EID: 0007364709     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009784115916     Document Type: Article

References (21)

1. K. Appel and W. Haken, "Every planar map is four colorable," A.M.S. Contemp. Math., vol. 98, 1989.
2. P. Catlin, "Hajós graph-coloring conjecture: Variations and counterexamples," J. Combin. Theory Ser. B, vol. 26, pp. 268-274, 1979.
3. V. Chvátal, "On certain polytopes associated with graphs," J. Combin. Theory Ser. B, vol. 18, pp. 138-154, 1975.
4. G.A. Dirac, "A property of 4-chromatic graphs and some remarks on critical graphs," J. London Math. Soc., vol. 27, pp. 85-92, 1952.
5. A.M.H. Gerards, "Homomorphisms of graphs into odd cycles," J. Graph Theory, vol. 12, pp. 73-83, 1988.
6. 4," J. Combin. Theory Ser. B, vol. 47, pp. 330-348, 1989.
7. A.M.H. Gerards and A. Schrijver, "Matrices with the Edmonds-Johnson property," Combinatorica, vol. 6, pp. 365-379, 1986.
8. H. Hadwiger, "Über eine klassifikation der streckenkomplexe," Vierteljahrsch. Naturforsch. Ges. Zürich, vol. 88, pp. 133-142, 1943.
9. G. Hajós, "Über eine konstruktion nicht n-färbbarer graphen," Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math.-Natur. Reihe, vol. 10, pp. 116-117, 1961.
10. T.R. Jensen and F.B. Shepherd, "Note on a conjecture of Toft," Combinatorica, vol. 15, pp. 373-377, 1995.
11. T.R. Jensen and B. Toft, Graph Coloring Problems, John Wiley & Sons, Inc., 1995.
12. 4 and 4-chromatic graphs," Monatsh. Math., vol. 89, pp. 101-110, 1980.
13. L. Lovász, "Some finite basis theorems in graph theory," in Combinatorics II, A. Hajnal and V.T. Sós (Eds.), Colloq. Math. Soc. Janos Bolyai, North-Holland: Amsterdam, 1986, vol. 18, pp. 717-729.
14. 6-free graphs," Combinatorica, vol. 13, pp. 279-361, 1993.
15. N. Robertson, D. Sanders, P. Seymour, and R. Thomas, "The four-colour theorem," J. Combin. Theory Ser. B, vol. 70, pp. 2-44, 1997.
16. 4," J. Combin. Theory Ser. B, vol. 59, pp. 74-84, 1993.
17. P. Seymour, Oral Communication.
18. C. Thomassen and B. Toft, "Non-separating induced cycles in graphs," J. Combin. Theory Ser. B, vol. 31, pp. 199-224, 1981.
19. B. Toft, "Problem 10," in Recent Advances in Graph Theory, Proc. of the Symposium held in Prague, June 1974, M. Fiedler (Ed.), Academia Praha, 1975, pp. 543-544.
20. B. Toft, "75 Graph-coloring problems," in Graph Colorings, R. Nelson and R.J. Wilson (Eds.), Longman Scientific and Technical, Wiley, 1990.
21. K. Wagner, "Über eine eigenschaft der ebene komplexe," Math. Ann., vol. 114, pp. 570-590, 1937.