Applications of hypergraph coloring to coloring graphs not inducing certain trees

DOI10.1016/0012-365X(95)00187-2zbMath0856.05039OpenAlexW2071534536MaRDI QIDQ1916109

Henry A. Kierstead, Vojtěch Rödl

Publication date: 1 September 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(95)00187-2

zbMATH Keywords

hypergraphschromatic numbertreescoloringopen problems

Mathematics Subject Classification ID

Trees (05C05) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items (10)

Induced subgraphs of graphs with large chromatic number. XI. Orientations ⋮ Classes of graphs that exclude a tree and a clique and are not vertex Ramsey ⋮ Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree ⋮ A note on the Gyárfás-Sumner conjecture ⋮ Polynomial bounds for chromatic number. V: Excluding a tree of radius two and a complete multipartite graph ⋮ Induced subgraphs of graphs with large chromatic number. XIII. New brooms ⋮ Extension of Gyárfás-Sumner conjecture to digraphs ⋮ Vertex Ramsey properties of families of graphs ⋮ Induced cycles and chromatic number ⋮ From \(\chi\)- to \(\chi_p\)-bounded classes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Induced subtrees in graphs of large chromatic number
• Colorful induced subgraphs
• On the structure of set-mappings
• Radius two trees specify χ‐bounded classes
• On chromatic number of graphs and set-systems

This page was built for publication: Applications of hypergraph coloring to coloring graphs not inducing certain trees