An upper bound on the chromatic number of a circle graph without \(K_4\)
From MaRDI portal
Publication:1930220
DOI10.1007/s10958-012-0886-0zbMath1256.05075arXiv1212.3983OpenAlexW1991458737MaRDI QIDQ1930220
Publication date: 10 January 2013
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1212.3983
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)
Related Items (1)
Cites Work
This page was built for publication: An upper bound on the chromatic number of a circle graph without \(K_4\)