A note on chromatic number and induced odd cycles
From MaRDI portal
Publication:1676794
zbMath1373.05071MaRDI QIDQ1676794
Xiaoya Zha, Gexin Yu, Bao-Gang Xu
Publication date: 10 November 2017
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i4p32
Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Perfect graphs (05C17)
Related Items (6)
On the structure of pentagraphs ⋮ Proof of a conjecture of Plummer and Zha ⋮ The chromatic number of a graph with two odd holes and an odd girth ⋮ 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 ⋮ A note on a conjecture of Wu, Xu and Xu
Cites Work
- Induced subgraphs of graphs with large chromatic number. I. Odd holes
- On a conjecture concerning the Petersen graph. II
- Substitution and \(\chi\)-boundedness
- On a conjecture concerning the Petersen graph
- Induced subgraphs of graphs with large chromatic number. IV: Consecutive holes
- The strong perfect graph theorem
- \(K_{4}\)-free graphs with no odd holes
- Induced subtrees in graphs of large chromatic number
- Induced cycles and chromatic number
- Induced subgraphs of graphs with large chromatic number. XI. Orientations
- Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes
- Graph Theory and Probability
- Radius two trees specify χ‐bounded classes
- Radius Three Trees in Graphs with Large Chromatic Number
- Sur le coloriage des graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A note on chromatic number and induced odd cycles
