Coloring Clean and K 4-Free Circle Graphs
From MaRDI portal
Publication:2847918
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
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)
Related Items
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