Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyárfás' conjectures

DOI10.1016/j.jctb.2016.01.003zbMath1332.05053arXiv1411.6465OpenAlexW281717368MaRDI QIDQ256991

Maria Chudnovsky, Alexander D. Scott, P. D. Seymour

Publication date: 14 March 2016

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1411.6465

zbMATH Keywords

holescolouringinduced subgraph\(\chi\)-bounded

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (10)

Coloring graphs with no even hole \(\geqslant 6\): the triangle-free case ⋮ A dichotomy theorem for circular colouring reconfiguration ⋮ Induced subgraphs of graphs with large chromatic number. XI. Orientations ⋮ Coloring curves that cross a fixed curve ⋮ The chromatic number of {ISK4, diamond, bowtie}‐free graphs ⋮ Some remarks on graphs with no induced subdivision of \(K_4\) ⋮ Characterization of forbidden subgraphs for bounded star chromatic number ⋮ Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors ⋮ Induced subgraphs of graphs with large chromatic number. IV: Consecutive holes ⋮ Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes

Cites Work

• Induced cycles and chromatic number
• Unnamed Item

This page was built for publication: Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyárfás' conjectures