Pages that link to "Item:Q4652608"
From MaRDI portal
The following pages link to Radius Three Trees in Graphs with Large Chromatic Number (Q4652608):
Displaying 24 items.
- Induced subgraphs of graphs with large chromatic number. I. Odd holes (Q326809) (← links)
- Locally bounded coverings and factorial properties of graphs (Q412246) (← 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)
- 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)
- Induced subgraphs of graphs with large chromatic number. XIII. New brooms (Q2011144) (← links)
- Hereditary classes of graphs: a parametric approach (Q2104934) (← links)
- Coloring graphs with no even hole \(\geqslant 6\): the triangle-free case (Q2363699) (← links)
- Excluding Induced Subdivisions of the Bull and Related Graphs (Q2911052) (← links)
- χ‐bounded families of oriented graphs (Q4646938) (← links)
- On the chromatic number of (P_{5},windmill)-free graphs (Q4690990) (← 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)
- A note on the Gyárfás-Sumner conjecture (Q6121918) (← links)
- Polynomial \(\chi\)-binding functions for \(t\)-broom-free graphs (Q6170792) (← links)
- Graphs of large chromatic number (Q6198641) (← links)
