Pages that link to "Item:Q1150627"
From MaRDI portal
The following pages link to A bound on the chromatic number of graphs without certain induced subgraphs (Q1150627):
Displaying 13 items.
- Vertex coloring of graphs with few obstructions (Q344868) (← links)
- Locally bounded coverings and factorial properties of graphs (Q412246) (← links)
- Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree (Q512863) (← links)
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- On the chromatic number of (P_{5},windmill)-free graphs (Q4690990) (← links)
- Polynomial bounds for chromatic number II: Excluding a star‐forest (Q6057629) (← links)
- Coloring of some crown-free graphs (Q6063283) (← links)
- An optimal χ‐bound for (P6, diamond)‐free graphs (Q6080859) (← links)
- On the chromatic number of \(P_5\)-free graphs with no large intersecting cliques (Q6084676) (← links)
- Bounds for the chromatic number of some \(pK_2\)-free graphs (Q6103479) (← links)
- Signed Ramsey numbers (Q6144499) (← links)
- Hitting all maximum stable sets in \(P_5\)-free graphs (Q6187345) (← links)
- Near optimal colourability on hereditary graph families (Q6196836) (← links)
