Coloring graphs with no odd-K4

Discrete Mathematics

Volumn 184, Issue 1-3, 1998, Pages 205-212

  Zang, Wenan ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0042357625     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(97)00090-3     Document Type: Article

References (10)

1. J.A. Bondy, U.S.R. Murty, Graph Theory with Applications, Macmillan, London, 1976.
2. P. Catlin, Hajós graph-coloring conjecture: variations and counterexamples, J. Combin. Theory Ser. B 26 (1979) 268-274.
3. A.M.H. Gerards, Homomorphisms of graphs into odd cycles, J. Graph Theory 12 (1988) 73-83.
4. 4, J. Combin. Theory Ser. B 47 (1989) 330-348.
5. A.M.H. Gerards, Graphs and Polyhedra Binary Spaces and Cutting Planes, CWI Tract 73, Amsterdam, 1990.
6. A.M.H. Gerards, An orientation theorem for graphs, J. Combin. Theory Ser. B 62 (1994) 199-212.
7. A.M.H. Gerards, A. Schrijver, Matrices with the Edmonds-Johnson property, Combinatorica 6 (1986) 365-379.
8. G.J. Minty, A theorem on n-coloring the points of a linear graph, Amer. Math. Monthly 67 (1962) 623-624.
9. R.E. Tarjan, Depth-first search and linear algorithms, SIAM J. Comput. 1 (1972) 146-160.
10. R.E. Tarjan, Data Structures and Network Algorithms, SIAM, Philadelphia, PA, 1983.