On the chromatic number of graphs of odd girth without longer odd holes

DOI10.1016/J.DAM.2023.09.027MaRDI QIDQ6184330zbMATH OpenFDO

Authors Hong Y. Wang

Publication date 24 January 2024

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2023.09.027

zbMATH Keywords

chromatic numberodd holeradius

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15)

Recommendations

• The chromatic number of a graph with two odd holes and an odd girth
• A note on a conjecture of Wu, Xu and Xu
• Graphs with girth 9 and without longer odd holes are 3-colourable
• A note on chromatic number and induced odd cycles

Cites work

• A note on a conjecture of Wu, Xu and Xu
• A note on chromatic number and induced odd cycles
• On a conjecture concerning the Petersen graph
• On a conjecture concerning the Petersen graph. II

Cited in

(2)

• Graphs with girth \(2\ell+1\) and without longer odd holes that contain an odd \(K_4\)-subdivision
• Graphs with girth 9 and without longer odd holes are 3-colourable

This page was built for publication: On the chromatic number of graphs of odd girth without longer odd holes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6184330)