Coloring Clean and K 4-Free Circle Graphs

DOI10.1007/978-1-4614-0110-0_21zbMath1272.05052OpenAlexW83872871MaRDI QIDQ2847918

Kevin G. Milans, Alexandr V. Kostochka

Publication date: 25 September 2013

Published in: Thirty Essays on Geometric Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4614-0110-0_21

zbMATH Keywords

intersection graphchromatic numberclique numbercircle graphchords drawn in a circle

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

An upper bound on the chromatic number of a circle graph without \(K_4\) ⋮ On-line approach to off-line coloring problems on graphs with geometric representations

This page was built for publication: Coloring Clean and K 4-Free Circle Graphs