A Note On Reed's Conjecture

DOI10.1137/060659193zbMath1191.05042arXivmath/0604499OpenAlexW1986681509WikidataQ123144666 ScholiaQ123144666MaRDI QIDQ3629477

Landon Rabern

Publication date: 27 May 2009

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0604499

zbMATH Keywords

graph coloringchromatic numberReed's conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (13)

Chromatic number of \(P_5\)-free graphs: Reed's conjecture ⋮ A Short Proof That χ Can be Bounded ε Away from Δ + 1 toward ω ⋮ Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ A note on Reed's conjecture for triangle-free graphs ⋮ Large cliques in graphs with high chromatic number ⋮ Special issue in honour of Landon Rabern ⋮ Graph coloring approach with new upper bounds for the chromatic number: team building application ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs ⋮ Some results on Reed's conjecture about \(\omega ,\Delta \), and \(\chi \) with respect to \(\alpha \) ⋮ Claw‐Free Graphs, Skeletal Graphs, and a Stronger Conjecture on ω, Δ, and χ ⋮ Square-Free Graphs with No Six-Vertex Induced Path ⋮ The chromatic discrepancy of graphs

This page was built for publication: A Note On Reed's Conjecture