A triangle-free circle graph with chromatic number 5

Discrete Mathematics

Volumn 152, Issue 1-3, 1996, Pages 295-298

  Ageev, A A ^a  

^a SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 9344257102     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(95)00349-2     Document Type: Article

References (7)

1. A. Gyárfás, On the chromatic number of multiple interval graphs and overlap graphs, Discrete Math. 55 (1985) 161-166.
2. A. Gyárfás and J. Lehel, Covering and coloring problems for relatives of intervals, Discrete Math. 55 (1985) 167-180.
3. T.R Jensen and B. Toft, Graph Coloring Problems (Wiley, New York, 1995).
4. A. Karapetyan, On perfect arc and chord intersection graphs, Ph.D. Thesis, Institute of Mathematics, Novosibirsk, 1984 (in Russian).
5. A.V. Kostochka, On upper bounds for the chromatic numbers of graphs, Trudy Inst. Mat. 10 (1988) 204-226 (in Russian).
6. A. Kostochka and J. Kratochvil, Covering and coloring polygon-circle graphs, Discrete Math., to appear.
7. H. Sachs, ed., Graphs, Hypergraphs and Applications, Proceedings of the Conference on Graph Theory, Eyba, October 1984, Problem Section (Teubner-Texte zur Mathematic, Band 73, Leipzig, 1985).