Radius Three Trees in Graphs with Large Chromatic Number
From MaRDI portal
Publication:4652608
DOI10.1137/S0895480198339869zbMath1055.05057OpenAlexW2029442750MaRDI QIDQ4652608
Yingxian Zhu, Henry A. Kierstead
Publication date: 28 February 2005
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895480198339869
Related Items (23)
Coloring graphs with no even hole \(\geqslant 6\): the triangle-free case ⋮ Induced subgraphs of graphs with large chromatic number. XI. Orientations ⋮ Excluding Induced Subdivisions of the Bull and Related Graphs ⋮ Induced subgraphs of graphs with large chromatic number. I. Odd holes ⋮ A note on chromatic number and induced odd cycles ⋮ Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree ⋮ On graphs with no induced five‐vertex path or paraglider ⋮ Polynomial bounds for chromatic number II: Excluding a star‐forest ⋮ Polynomial bounds for chromatic number. III. Excluding a double star ⋮ Locally bounded coverings and factorial properties of graphs ⋮ Chromatic number and subtrees of graphs ⋮ A note on the Gyárfás-Sumner conjecture ⋮ Polynomial \(\chi\)-binding functions for \(t\)-broom-free graphs ⋮ Graphs of large chromatic number ⋮ Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of \(P_4\) ⋮ Characterization of forbidden subgraphs for bounded star chromatic number ⋮ Substitution and \(\chi\)-boundedness ⋮ Excluding cycles with a fixed number of chords ⋮ Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey ⋮ Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors ⋮ Induced subgraphs of graphs with large chromatic number. XIII. New brooms ⋮ Square-Free Graphs with No Six-Vertex Induced Path ⋮ Hereditary classes of graphs: a parametric approach
This page was built for publication: Radius Three Trees in Graphs with Large Chromatic Number
