Induced subgraphs of graphs with large chromatic number. III: Long holes
From MaRDI portal
Publication:722311
DOI10.1007/s00493-016-3467-xzbMath1399.05068arXiv1506.02232OpenAlexW2964147791MaRDI QIDQ722311
Maria Chudnovsky, Paul Seymoury, Alexander D. Scott
Publication date: 23 July 2018
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.02232
Coloring of graphs and hypergraphs (05C15) Perfect graphs (05C17) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (18)
Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs ⋮ The chromatic number of {ISK4, diamond, bowtie}‐free graphs ⋮ Some remarks on graphs with no induced subdivision of \(K_4\) ⋮ Graphs of large chromatic number ⋮ Induced subgraphs of graphs with large chromatic number. VI. Banana trees ⋮ Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey ⋮ A better upper bound on the chromatic number of (cap, even-hole)-free graphs ⋮ Chi-boundedness of graph classes excluding wheel vertex-minors ⋮ Induced subgraphs of graphs with large chromatic number. IV: Consecutive holes ⋮ Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes ⋮ Classes of graphs with no long cycle as a vertex-minor are polynomially \(\chi\)-bounded ⋮ Structure and colour in triangle-free graphs ⋮ Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings ⋮ Pure pairs. II: Excluding all subdivisions of a graph ⋮ Notes on tree- and path-chromatic number ⋮ In absence of long chordless cycles, large tree-width becomes a local phenomenon ⋮ From \(\chi\)- to \(\chi_p\)-bounded classes ⋮ Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure
Cites Work
This page was built for publication: Induced subgraphs of graphs with large chromatic number. III: Long holes
