\(K_{4}\)-free graphs with no odd holes
From MaRDI portal
Publication:965257
DOI10.1016/j.jctb.2009.10.001zbMath1274.05238OpenAlexW1971145624MaRDI QIDQ965257
Maria Chudnovsky, Robin Thomas, Neil Robertson, P. D. Seymour
Publication date: 21 April 2010
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2009.10.001
Related Items (16)
Induced subgraphs of graphs with large chromatic number. I. Odd holes ⋮ 2-divisibility of some odd hole free graphs ⋮ A note on chromatic number and induced odd cycles ⋮ Triangle packings and transversals of some \(K_{4}\)-free graphs ⋮ On the chromatic number of (\(P_6\), diamond)-free graphs ⋮ $t$-Perfection in $P_5$-Free Graphs ⋮ Some remarks on graphs with no induced subdivision of \(K_4\) ⋮ Improved bounds on the chromatic number of (\(P_5\), flag)-free graphs ⋮ Three-colourable perfect graphs without even pairs ⋮ Some problems on induced subgraphs ⋮ Coloring (\(P_5\), kite)-free graphs with small cliques ⋮ Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey ⋮ \(k\)-critical graphs in \(P_5\)-free graphs ⋮ \(k\)-critical graphs in \(P_5\)-free graphs ⋮ $(2P_2,K_4)$-Free Graphs are 4-Colorable ⋮ A faster algorithm to recognize even-hole-free graphs
Cites Work
This page was built for publication: \(K_{4}\)-free graphs with no odd holes
