Coloring circle graphs

DOI10.1016/j.endm.2007.07.072zbMath1341.05057OpenAlexW2170095639WikidataQ56503304 ScholiaQ56503304MaRDI QIDQ3503503

Jakub Černý

Publication date: 5 June 2008

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

Full work available at URL: https://doi.org/10.1016/j.endm.2007.07.072

zbMATH Keywords

intersection graphchromatic numbercircle graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (8)

Word-Representable Graphs: a Survey ⋮ An upper bound on the chromatic number of a circle graph without \(K_4\) ⋮ On the Page Number of Upward Planar Directed Acyclic Graphs ⋮ On the representation number of a crown graph ⋮ On-line approach to off-line coloring problems on graphs with geometric representations ⋮ Generalised online colouring problems in overlap graphs ⋮ Outerstring Graphs are $\chi$-Bounded ⋮ Word-representability of Toeplitz graphs

Cites Work

• Unnamed Item
• On the chromatic number of multiple interval graphs and overlap graphs
• Covering and coloring polygon-circle graphs
• A triangle-free circle graph with chromatic number 5

This page was built for publication: Coloring circle graphs