Pages that link to "Item:Q4284098"
From MaRDI portal
The following pages link to Radius two trees specify χ‐bounded classes (Q4284098):
Displayed 40 items.
- Induced subgraphs of graphs with large chromatic number. I. Odd holes (Q326809) (← links)
- Classes of graphs with small rank decompositions are \(\chi \)-bounded (Q412260) (← links)
- Substitution and \(\chi\)-boundedness (Q461725) (← links)
- Excluding cycles with a fixed number of chords (Q476296) (← links)
- Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors (Q505914) (← links)
- First-fit coloring of bounded tolerance graphs (Q531602) (← links)
- Square-free graphs with no induced fork (Q831350) (← links)
- Large induced trees in \(K_r\)-free graphs (Q1003853) (← links)
- Colorful induced subgraphs (Q1197025) (← links)
- Induced cycles and chromatic number (Q1306304) (← links)
- Classes of graphs that exclude a tree and a clique and are not vertex Ramsey (Q1375696) (← links)
- Triangle-free graphs and forbidden subgraphs (Q1613361) (← links)
- Induced subgraphs of graphs with large chromatic number. XI. Orientations (Q1633601) (← links)
- A note on chromatic number and induced odd cycles (Q1676794) (← links)
- Chromatic number and subtrees of graphs (Q1692708) (← links)
- Characterization of forbidden subgraphs for bounded star chromatic number (Q1712503) (← links)
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey (Q1733849) (← links)
- Applications of hypergraph coloring to coloring graphs not inducing certain trees (Q1916109) (← links)
- Induced subgraphs of graphs with large chromatic number. XIII. New brooms (Q2011144) (← links)
- Hereditary classes of graphs: a parametric approach (Q2104934) (← links)
- Coloring graph classes with no induced fork via perfect divisibility (Q2161205) (← links)
- Mycielski type constructions for hypergraphs associated with fractional colorings (Q2254688) (← links)
- Coloring graphs with no even hole \(\geqslant 6\): the triangle-free case (Q2363699) (← links)
- Vizing bound for the chromatic number on some graph classes (Q2631086) (← links)
- Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs (Q2664559) (← links)
- Classes of graphs without star forests and related graphs (Q2675850) (← links)
- Excluding Induced Subdivisions of the Bull and Related Graphs (Q2911052) (← links)
- On the Ramsey Property of Families of Graphs (Q4698771) (← links)
- Square-Free Graphs with No Six-Vertex Induced Path (Q5232134) (← links)
- Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree (Q6046682) (← links)
- On graphs with no induced five‐vertex path or paraglider (Q6055942) (← links)
- Polynomial bounds for chromatic number II: Excluding a star‐forest (Q6057629) (← links)
- Polynomial bounds for chromatic number. III. Excluding a double star (Q6057630) (← links)
- Polynomial bounds for chromatic number. V: Excluding a tree of radius two and a complete multipartite graph (Q6144408) (← links)
- Induced subgraphs and path decompositions (Q6162145) (← links)
- Polynomial \(\chi\)-binding functions for \(t\)-broom-free graphs (Q6170792) (← links)
- Hitting all maximum stable sets in \(P_5\)-free graphs (Q6187345) (← links)
- A Generalization of $$\chi $$-Binding Functions (Q6193839) (← links)
- Graphs of large chromatic number (Q6198641) (← links)
- Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of \(P_4\) (Q6199196) (← links)
