Graphs with girth 9 and without longer odd holes are 3-colourable

DOI10.1002/JGT.23101MaRDI QIDQ6565814zbMATH OpenFDO

Authors Yan Wang, Rong Wu

Publication date 2 July 2024

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/JGT.23101

zbMATH Keywords

colouringinduced subgraphodd hole

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Recommendations

• A note on a conjecture of Wu, Xu and Xu
• On the chromatic number of graphs of odd girth without longer odd holes
• Graphs with girth \(2\ell+1\) and without longer odd holes that contain an odd \(K_4\)-subdivision
• The chromatic number of a graph with two odd holes and an odd girth

Cites work

• A note on chromatic number and induced odd cycles
• A survey of -boundedness
• Bisimplicial vertices in even-hole-free graphs
• Even-hole-free graphs still have bisimplicial vertices
• scientific article; zbMATH DE number 3480625 (Why is no real title available?)
• Induced subgraphs of graphs with large chromatic number. I. Odd holes
• On a conjecture concerning the Petersen graph
• On a conjecture concerning the Petersen graph. II
• On the divisibility of graphs
• Proof of a conjecture of Plummer and Zha
• Some problems on induced subgraphs
• The strong perfect graph theorem

Cited in

(4)

• On the chromatic number of graphs of odd girth without longer odd holes
• Graphs with girth \(2\ell+1\) and without longer odd holes that contain an odd \(K_4\)-subdivision
• Graphs with girth 2 +1 and without longer odd holes are 3-colorable
• Coloring of graphs without long odd holes

This page was built for publication: Graphs with girth 9 and without longer odd holes are 3-colourable

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