Coloring of graphs without long odd holes

DOI10.1016/J.DISC.2026.115145MaRDI QIDQ7231855zbMATH OpenFDO

Authors Ran Chen, Baogang Xu

Publication date 22 April 2026

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2026.115145

zbMATH Keywords

chromatic numbergirthodd hole

Mathematics Subject Classification ID

Combinatorics (05-XX) Computer science (68-XX)

Cites work

• A note on chromatic number and induced odd cycles
• Graph theory
• Graph Theory and Probability
• Graphs with girth 9 and without longer odd holes are 3-colourable
• Graphs with girth 2 +1 and without longer odd holes are 3-colorable
• scientific article; zbMATH DE number 3480625 (Why is no real title available?)
• scientific article; zbMATH DE number 4183452 (Why is no real title available?)
• Induced subgraphs of graphs with large chromatic number. I. Odd holes
• Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyárfás' conjectures
• Induced subgraphs of graphs with large chromatic number. III: Long holes
• Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes
• On a conjecture concerning the Petersen graph. II
• Proof of a conjecture of Plummer and Zha
• The chromatic number of a graph with two odd holes and an odd girth
• The chromatic number of heptagraphs
• The strong perfect graph theorem

This page was built for publication: Coloring of graphs without long odd holes

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