Radius two trees specify χ‐bounded classes
From MaRDI portal
Publication:4284098
DOI10.1002/JGT.3190180203zbMATH Open0798.05023OpenAlexW2094108224MaRDI QIDQ4284098FDOQ4284098
Authors: S. G. Penrice, H. A. Kierstead 
Publication date: 20 October 1994
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190180203
Recommendations
Cites Work
Cited In (45)
- Induced subgraphs of graphs with large chromatic number. I. Odd holes
- First-fit coloring of bounded tolerance graphs
- Perfect divisibility and coloring of some fork-free graphs
- Square-free graphs with no induced fork
- Polynomial bounds for chromatic number. V: Excluding a tree of radius two and a complete multipartite graph
- Classes of graphs with small rank decompositions are \(\chi \)-bounded
- Classes of graphs without star forests and related graphs
- Hereditary classes of graphs: a parametric approach
- Excluding induced subdivisions of the bull and related graphs
- Induced subgraphs and path decompositions
- Induced cycles and chromatic number
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
- Characterization of forbidden subgraphs for bounded star chromatic number
- Induced subgraphs of graphs with large chromatic number. XI. Orientations
- Radius Three Trees in Graphs with Large Chromatic Number
- Large induced trees in \(K_r\)-free graphs
- Triangle-free graphs and forbidden subgraphs
- Coloring graphs with no even hole \(\geqslant 6\): the triangle-free case
- Polynomial bounds for chromatic number II: Excluding a star‐forest
- Polynomial bounds for chromatic number. III. Excluding a double star
- Vizing bound for the chromatic number on some graph classes
- Classes of graphs that exclude a tree and a clique and are not vertex Ramsey
- Substitution and \(\chi\)-boundedness
- Hitting all maximum stable sets in \(P_5\)-free graphs
- Coloring graph classes with no induced fork via perfect divisibility
- Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs
- A Generalization of $$\chi $$-Binding Functions
- Graphs of large chromatic number
- Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of \(P_4\)
- On the Ramsey Property of Families of Graphs
- Applications of hypergraph coloring to coloring graphs not inducing certain trees
- Excluding cycles with a fixed number of chords
- χ‐bounded families of oriented graphs
- A note on chromatic number and induced odd cycles
- Polynomial bounds for chromatic number. VIII: Excluding a path and a complete multipartite graph
- Mycielski type constructions for hypergraphs associated with fractional colorings
- Square-Free Graphs with No Six-Vertex Induced Path
- On graphs with no induced five‐vertex path or paraglider
- Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors
- Induced subgraphs of graphs with large chromatic number. XIII. New brooms
- Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree
- Chromatic number and subtrees of graphs
- On the chromatic number of (P_{5},windmill)-free graphs
- Colorful induced subgraphs
- Polynomial \(\chi\)-binding functions for \(t\)-broom-free graphs
This page was built for publication: Radius two trees specify χ‐bounded classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4284098)
