On the list coloring version of Reed's conjecture

DOI10.1016/j.endm.2017.06.058zbMath1378.05054OpenAlexW2744353744WikidataQ122979929 ScholiaQ122979929MaRDI QIDQ1689939

Michelle Delcourt, Luke Postle

Publication date: 18 January 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.06.058

zbMATH Keywords

graph coloringlist coloringReed's conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (5)

On the Nash number and the diminishing Grundy number of a graph ⋮ Bounding \(\chi\) by a fraction of \(\Delta\) for graphs without large cliques ⋮ Properties of 8-contraction-critical graphs with no \(K_7\) minor ⋮ Corrigendum to: ``A local epsilon version of Reed's conjecture ⋮ A local epsilon version of Reed's conjecture

Cites Work

• Unnamed Item
• A bound on the strong chromatic index of a graph
• A Short Proof That χ Can be Bounded ε Away from Δ + 1 toward ω
• A Stronger Bound for the Strong Chromatic Index
• Hitting all maximum cliques with a stable set using lopsided independent transversals

This page was built for publication: On the list coloring version of Reed's conjecture