The following pages link to A Note On Reed's Conjecture (Q3629477):
Displaying 16 items.
- Chromatic number of \(P_5\)-free graphs: Reed's conjecture (Q279215) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs (Q536214) (← links)
- Some results on Reed's conjecture about \(\omega ,\Delta \), and \(\chi \) with respect to \(\alpha \) (Q968410) (← links)
- A contribution to Reich's conjecture (Q2330969) (← links)
- The chromatic discrepancy of graphs (Q2341751) (← links)
- (Q3319331) (← links)
- A Short Proof That χ Can be Bounded ε Away from Δ + 1 toward ω (Q3466351) (← links)
- (Q3484983) (← links)
- Graph coloring approach with new upper bounds for the chromatic number: team building application (Q4611483) (← links)
- Claw‐Free Graphs, Skeletal Graphs, and a Stronger Conjecture on ω, Δ, and χ (Q4982280) (← links)
- Square-Free Graphs with No Six-Vertex Induced Path (Q5232134) (← links)
- Combinatorics. Abstracts from the workshop held January 1--7, 2023 (Q6052106) (← links)
- A note on Reed's conjecture for triangle-free graphs (Q6080563) (← links)
- Large cliques in graphs with high chromatic number (Q6091811) (← links)
- Special issue in honour of Landon Rabern (Q6091821) (← links)
