Radius two trees specify χ‐bounded classes
From MaRDI portal
Recommendations
Cites work
Cited in
(59)- Large induced trees in \(K_r\)-free graphs
- Colorful induced subgraphs
- Induced cycles and chromatic number
- Classes of graphs that exclude a tree and a clique and are not vertex Ramsey
- Triangle-free graphs and forbidden subgraphs
- Induced subgraphs of graphs with large chromatic number. XI. Orientations
- A note on chromatic number and induced odd cycles
- Chromatic number and subtrees of graphs
- Characterization of forbidden subgraphs for bounded star chromatic number
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
- Applications of hypergraph coloring to coloring graphs not inducing certain trees
- Induced subgraphs of graphs with large chromatic number. XIII. New brooms
- Hereditary classes of graphs: a parametric approach
- Coloring graph classes with no induced fork via perfect divisibility
- Mycielski type constructions for hypergraphs associated with fractional colorings
- Coloring graphs with no even hole \(\geqslant 6\): the triangle-free case
- Vizing bound for the chromatic number on some graph classes
- Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs
- Classes of graphs without star forests and related graphs
- Excluding induced subdivisions of the bull and related graphs
- Induced subgraphs of graphs with large chromatic number. I. Odd holes
- Classes of graphs with small rank decompositions are \(\chi \)-bounded
- Substitution and \(\chi\)-boundedness
- χ‐bounded families of oriented graphs
- Radius Three Trees in Graphs with Large Chromatic Number
- On the chromatic number of (P_{5},windmill)-free graphs
- On the Ramsey Property of Families of Graphs
- Excluding cycles with a fixed number of chords
- Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors
- Square-Free Graphs with No Six-Vertex Induced Path
- First-fit coloring of bounded tolerance graphs
- 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
- Polynomial bounds for chromatic number. V: Excluding a tree of radius two and a complete multipartite graph
- Induced subgraphs and path decompositions
- Polynomial \(\chi\)-binding functions for \(t\)-broom-free graphs
- Hitting all maximum stable sets in P₅-free graphs
- 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₄
- Perfect divisibility and coloring of some fork-free graphs
- Polynomial bounds for chromatic number. VIII: Excluding a path and a complete multipartite graph
- Trisimplicial vertices in (fork, odd parachute)-free graphs
- A note on -binding functions and linear forests
- The dichromatic number of digraphs without induced subdigraphs
- Chi-boundedness of graphs containing no cycles with k chords
- Induced subdivisions in \(K_{s,s}\)-free graphs with polynomial average degree
- Chordal graphs, even-hole-free graphs and sparse obstructions to bounded treewidth
- A Ramsey-type theorem on deficiency
- A survey of degree-boundedness
- Induced C₄-free subgraphs with large average degree
- Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of P₄ (extended abstract)
- Kővári-Sós-Turán theorem for hereditary families
- -boundedness and related problems on graphs without long induced paths: a survey
- Polynomial Gyárfás-Sumner conjecture for graphs of bounded boxicity
- Ramsey-type results on parameters related to domination
- Square-free graphs with no induced fork
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)
