An upper bound on adaptable choosability of graphs

Mickaël Montassier, André Raspaud, Xuding Zhu

Type: Article

Publication Date: 2008-07-28

Citations: 8

DOI: https://doi.org/10.1016/j.ejc.2008.06.003

View Publication

Locations

European Journal of Combinatorics - View
CiteSeer X (The Pennsylvania State University) - View - PDF
HAL (Le Centre pour la Communication Scientifique Directe) - View - PDF

Similar Works

Action	Title	Year	Authors
+	Adaptable choosability of planar graphs with sparse short cycles	2009	Albert Guan Xuding Zhu
+	An Improved Upper Bound on Edge Weight Choosability of Graphs	2014	Guanghui Wang Guiying Yan
+	On the adaptable chromatic number of graphs	2008	HellPavol ZhuXuding
+	A note on adaptable choosability and choosability with separation of planar graphs	2020	Carl Johan Casselgren Jonas B. Granholm André Raspaud
+	A note on adaptable choosability and choosability with separation of planar graphs	2020	Carl Johan Casselgren Jonas B. Granholm André Raspaud
+	5-choosability of graphs with crossings far apart	2016	Zdeněk Dvořák Bernard Lidický Bojan Mohar
+	None	2009
+	Adaptable chromatic number of graph products	2009	Pavol Hell Zhishi Pan Tsai‐Lien Wong Xuding Zhu
+	Incidence choosability of graphs	2019	Brahim Benmedjdoub Isma Bouchemakh Éric Sopena
+	Choosability in geometric hypergraphs	2010	Panagiotis Cheilaris Shakhar Smorodinsky
+	The Adaptable Chromatic Number and the Chromatic Number	2016	Michael Molloy
+	Linear choosability of sparse graphs	2011	Daniel W. Cranston Gexin Yu
+ PDF Chat	A Simple Characterization of Proportionally 2-choosable Graphs	2020	Hemanshu Kaul Jeffrey A. Mudrock Michael J. Pelsmajer Benjamin Reiniger
+ PDF Chat	On Group Choosability of Total Graphs	2011	Hong‐Jian Lai G.R. Omidi Ghaffar Raeisi
+	The complexity of planar graph choosability	1996	Shai Gutner
+	On choosability with separation of planar graphs with lists of different sizes	2015	H. A. Kierstead Bernard Lidický
+ PDF Chat	Total weight choosability for Halin graphs	2021	Yu‐Chang Liang Tsai–Lien Wong Xuding Zhu
+	Total weight choosability for Halin graphs	2017	Yu‐Chang Liang Tsai–Lien Wong Xuding Zhu
+	Adaptable and conflict colouring multigraphs with no cycles of length three or four	2021	Jurgen Aliaj Michael Molloy
+ PDF Chat	Choosability of Graphs with Bounded Order: Ohbaʼs Conjecture and Beyond	2013	Jonathan A. Noel Bruce A. Reed Douglas B. West Hehui Wu Xuding Zhu

Works That Cite This (7)

Action	Title	Year	Authors
+	Adaptable choosability of planar graphs with sparse short cycles	2009	Albert Guan Xuding Zhu
+	Adapted game colouring of graphs	2011	H. A. Kierstead Chung-Ying Yang Daqing Yang Xuding Zhu
+	Adapted list coloring of planar graphs	2009	Louis Esperet Mickaël Montassier Xuding Zhu
+	None	2009
+	Adaptable chromatic number of graph products	2009	Pavol Hell Zhishi Pan Tsai‐Lien Wong Xuding Zhu
+ PDF Chat	Adaptable and conflict colouring multigraphs with no cycles of length three or four	2023	Jurgen Aliaj Michael Molloy
+	A note on adaptable choosability and choosability with separation of planar graphs	2020	Carl Johan Casselgren Jonas B. Granholm André Raspaud

Works Cited by This (9)

Action	Title	Year	Authors
+	The State of the Three Color Problem	1993	Richard Steinberg
+	On the adaptable chromatic number of graphs	2008	Pavol Hell Xuding Zhu
+	Adaptable choosability of planar graphs with sparse short cycles	2009	Albert Guan Xuding Zhu
+	On the degrees of the vertices of a directed graph	1965	S. L. Hakimi
+	None	2009
+ PDF Chat	The Chromatic Number of Random Regular Graphs	2004	Dimitris Achlioptas Cristopher Moore
+	Surveys in Combinatorics	1979
+	The Chromatic Number of Random Regular Graphs	2004	Dimitris Achlioptas Cristopher Moore
+ PDF Chat	Restricted colorings of graphs	1993	Noga Alon