On the List Coloring Version of Reed's Conjecture

Michelle Delcourt, Luke Postle

Type: Article

Publication Date: 2017-08-01

Citations: 7

DOI: https://doi.org/10.1016/j.endm.2017.06.058

View Publication

Download PDF

Locations

Electronic Notes in Discrete Mathematics - View - PDF

Similar Works

Action	Title	Year	Authors
+	On a List-Coloring Version of the Erdös-Faber-Lovász Conjecture	2009	Suneil Vallabh
+	The chromatic polynomial and list colorings	2008	Carsten Thomassen
+	On a list coloring conjecture of Reed	2002	Tom Bohman Ron Holzman
+	On a list-coloring problem	2003	Sylvain Gravier Frédéric Maffray Bojan Mohar
+	Bounding $\chi$ by a fraction of $\Delta$ for graphs without large cliques	2018	Marthe Bonamy Tom Kelly Peter Nelson Luke Postle
+	A local epsilon version of Reed's Conjecture	2019	Tom Kelly Luke Postle
+	Restricted list coloring and Hall's condition	2002	M. M. Cropper John Goldwasser
+	When does the list-coloring function of a graph equal its chromatic polynomial	2016	Wei Wang Jianguo Qian Zhidan Yan
+ PDF Chat	A Local Epsilon Version of Reed's Conjecture	2017	Tom Kelly Luke Postle
+	Some results on a list coloring conjecture of Reed	2006	Xu Yang Zhu Xiao
+	Two Chromatic Conjectures: One for Vertices and One for Edges	2016	P. Mark Kayll
+	An Introduction to List Colorings of Graphs	2009	Courtney Leigh Baber
+	The list chromatic number of graphs with small clique number	2017	Michael Molloy
+	The list chromatic number of graphs with small clique number	2017	Michael Molloy
+	On the list color function threshold	2023	Hemanshu Kaul Akash Kumar Jeffrey A. Mudrock Patrick Rewers Paul Shin Khue To
+ PDF Chat	List Coloring in the Absence of a Linear Forest	2013	Jean-Fraņcois Couturier Petr A. Golovach Dieter Kratsch Daniël Paulusma
+	Tight Lower Bounds for List Edge Coloring	2018	Łukasz Kowalik Arkadiusz Socała
+	A Short Proof that the List Packing Number of any Graph is Well Defined	2022	Jeffrey A. Mudrock
+ PDF Chat	A short proof that the list packing number of any graph is well defined	2022	Jeffrey A. Mudrock
+	Bounding $χ$ by a fraction of $Δ$ for graphs without large cliques	2018	Marthe Bonamy Tom Kelly Peter S. Nelson Luke Postle

Works That Cite This (7)

Action	Title	Year	Authors
+	Bounding $\chi$ by a fraction of $\Delta$ for graphs without large cliques	2018	Marthe Bonamy Tom Kelly Peter Nelson Luke Postle
+	A local epsilon version of Reed's Conjecture	2019	Tom Kelly Luke Postle
+ PDF Chat	A Local Epsilon Version of Reed's Conjecture	2017	Tom Kelly Luke Postle
+ PDF Chat	On the Nash number and the diminishing Grundy number of a graph	2022	Frédéric Havet Allen Ibiapina Leonardo Sampaio
+ PDF Chat	An improved procedure for colouring graphs of bounded local density	2021	Eoin Hurley Rémi de Joannis de Verclos Ross J. Kang
+	Extensions of Galvin's Theorem	2018	Maxwell Levit
+ PDF Chat	An improved procedure for colouring graphs of bounded local density	2022	Eoin Hurley Rémi de Joannis de Verclos Ross J. Kang

Works Cited by This (6)

Action	Title	Year	Authors
+	A Short Proof That χ Can be Bounded ε Away from Δ + 1 toward ω	2015	Andrew D. King Bruce A. Reed
+	ω, Δ, and χ	1998	Bruce Reed
+ PDF Chat	Colouring graphs with sparse neighbourhoods: Bounds and applications	2022	Marthe Bonamy Thomas Perrett Luke Postle
+ PDF Chat	A stronger bound for the strong chromatic index	2015	Henning Bruhn Felix Joos
+ PDF Chat	Hitting all maximum cliques with a stable set using lopsided independent transversals	2010	Andrew D. King
+	?, ?, and ?	1998	Bruce Reed