Every circle graph of girth at least 5 is 3-colourable

Discrete Mathematics

Volumn 195, Issue 1-3, 1999, Pages 229-233

  Ageev, A A ^a  

^a SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

Author keywords

Chromatic number; Circle graph; Girth

Indexed keywords

EID: 9344271496     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(98)00192-7     Document Type: Article

References (5)

1. A.A. Age ev, A triangle-free circle graph with chromatic number 5, Discrete Math. 152 (1996) 295-298.
2. A. Gyárfás, J. Lehel, Covering and coloring problems for relatives of intervals, Discrete Math. 55 (1985) 167-180.
3. T.R. Jensen, 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).