A triangle-free circle graph with chromatic number 5

DOI10.1016/0012-365X(95)00349-2zbMath0854.05049WikidataQ55954533 ScholiaQ55954533MaRDI QIDQ1917502

A. A. Ageev

Publication date: 13 January 1997

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

zbMATH Keywords

chordschromatic numbercircle graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Improved bounds for colouring circle graphs ⋮ An upper bound on the chromatic number of a circle graph without \(K_4\) ⋮ Coloring circle graphs ⋮ Independent sets and chromatic numbers of circle graphs ⋮ On-line approach to off-line coloring problems on graphs with geometric representations ⋮ On fixed-order book thickness parameterized by the pathwidth of the vertex ordering ⋮ Every circle graph of girth at least 5 is 3-colourable ⋮ Circle graphs are quadratically χ‐bounded ⋮ Fixed-order book thickness with respect to the vertex-cover number: new observations and further analysis

Cites Work

• Unnamed Item
• Unnamed Item
• On the chromatic number of multiple interval graphs and overlap graphs
• Covering and coloring problems for relatives of intervals
• Covering and coloring polygon-circle graphs
• 25 pretty graph colouring problems