Pages that link to "Item:Q2662887"
From MaRDI portal
The following pages link to The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices (Q2662887):
Displaying 4 items.
- Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree (Q512863) (← links)
- Chromatic Number of Triangle-free Graphs With Some Forbidden Subgraphs (Q3461265) (← links)
- (Q5309532) (← links)
- Polynomial \(\chi\)-binding functions for \(t\)-broom-free graphs (Q6170792) (← links)