Pages that link to "Item:Q2011144"
From MaRDI portal
The following pages link to Induced subgraphs of graphs with large chromatic number. XIII. New brooms (Q2011144):
Displaying 15 items.
- Induced subgraphs of graphs with large chromatic number. I. Odd holes (Q326809) (← links)
- Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree (Q512863) (← links)
- Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings (Q2040019) (← links)
- Induced subgraphs of graphs with large chromatic number. VI. Banana trees (Q2200935) (← links)
- Induced subgraphs of graphs with large chromatic number. X. Holes of specific residue (Q2288360) (← links)
- Induced subgraphs of graphs with large chromatic number. IX: Rainbow paths (Q2363116) (← links)
- The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices (Q2662887) (← links)
- Induced subgraphs of graphs with large chromatic number. XII. Distant stars (Q5207465) (← links)
- Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree (Q6046682) (← 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)
- Polynomial bounds for chromatic number. VIII: Excluding a path and a complete multipartite graph (Q6642504) (← links)
