Every circle graph of girth at least 5 is 3-colourable
From MaRDI portal
Publication:1296984
DOI10.1016/S0012-365X(98)00192-7zbMath0934.05054WikidataQ56503303 ScholiaQ56503303MaRDI QIDQ1296984
Publication date: 10 April 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
On circle graphs with girth at least five, Islands in Graphs on Surfaces, List total arboricity of 2-degenerate graphs, An upper bound on the chromatic number of a circle graph without \(K_4\), Acyclic edge coloring of 2-degenerate graphs
Cites Work