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

DOI10.1016/S0012-365X(98)00192-7zbMath0934.05054WikidataQ56503303 ScholiaQ56503303MaRDI QIDQ1296984

A. A. Ageev

Publication date: 10 April 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

intersection graphcolouringgirthcircle graphcolour-lists

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (5)

An upper bound on the chromatic number of a circle graph without \(K_4\) ⋮ On circle graphs with girth at least five ⋮ Islands in Graphs on Surfaces ⋮ List total arboricity of 2-degenerate graphs ⋮ Acyclic edge coloring of 2-degenerate graphs

Cites Work

• Covering and coloring problems for relatives of intervals
• A triangle-free circle graph with chromatic number 5
• 25 pretty graph colouring problems
• Unnamed Item

This page was built for publication: Every circle graph of girth at least 5 is 3-colourable