A refinement of choosability of graphs

Xuding Zhu

Type: Article

Publication Date: 2019-08-06

Citations: 21

DOI: https://doi.org/10.1016/j.jctb.2019.07.006

View Publication

Locations

Journal of Combinatorial Theory Series B - View
arXiv (Cornell University) - View - PDF

Similar Works

Action	Title	Year	Authors
+	A refinement of choosability of graphs	2018	Xuding Zhu
+	Girth and $λ$-choosability of graphs	2021	Yangyan Gu Xuding Zhu
+	Choosability of planar graphs	1996	Margit Voigt
+ PDF Chat	On Choosability with Separation of Planar Graphs with Forbidden Cycles	2015	Ilkyoo Choi Bernard Lidický Derrick Stolee
+	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
+	A NOTE ON EDGE WEIGHT CHOOSABILITY OF GRAPHS	2013	Jingcheng Fu Guanghui Wang Jianliang Wu Jin Xu
+	On the choosability with separation of planar graphs and its correspondence colouring analogue	2022	Evelyne Smith‐Roberge
+	Refined list version of Hadwiger’s Conjecture	2023	Yangyan Gu Yiting Jiang David R. Wood Xuding Zhu
+	Refined list version of Hadwiger's conjecture	2022	Yangyan Gu Yiting Jiang David R. Wood Xuding Zhu
+ PDF Chat	Refined List Version of Hadwiger’s Conjecture	2023	Yangyan Gu Yiting Jiang David R. Wood Xuding Zhu
+ PDF Chat	On (4, 2)-Choosable Graphs	2016	Jixian Meng Gregory J. Puleo Xuding Zhu
+	Bounding the weight choosability number of a graph	2012	Ben Seamone
+	Choosability with union separation	2015	Mohit Kumbhat Kevin Moss Derrick Stolee
+	Choosability with union separation	2015	Mohit Kumbhat Kevin Moss Derrick Stolee
+	Beyond Degree Choosability	2015	Daniel W. Cranston Landon Rabern
+	Beyond Degree Choosability	2015	Daniel W. Cranston Landon Rabern
+ PDF Chat	Vertex Colouring Edge Weightings: a Logarithmic Upper Bound on Weight-Choosability	2021	Kasper Szabo Lyngsie Liang Zhong
+	Choosability in signed planar graphs	2015	Ligang Jin Yingli Kang Eckhard Steffen
+	Choosability of Graphs with Bounded Order: Ohba's Conjecture and Beyond	2013	Jonathan A. Noel

Works That Cite This (16)

Action	Title	Year	Authors
+ PDF Chat	List 4-colouring of planar graphs	2023	Xuding Zhu
+	The Alon-Tarsi number of a planar graph minus a matching	2018	Jarosław Grytczuk Xuding Zhu
+	Minimum non-chromatic-λ-choosable graphs	2023	Jialu Zhu Xuding Zhu
+	Chromatic $\lambda$-choosable and $\lambda$-paintable graphs	2019	Jialu Zhu Xuding Zhu
+	Circular chromatic number of signed graphs	2020	Reza Naserasr Zhouningxin Wang Xuding Zhu
+	Complexity of Near-3-Choosability Problem	2024	Sounaka Mishra S Rohini Sagar S. Sawant
+	The Alon-Tarsi number of a planar graph minus a matching	2020	Jarosław Grytczuk Xuding Zhu
+	Concepts of signed graph coloring	2020	Eckhard Steffen Alexander Vogel
+	On the 4-color theorem for signed graphs	2020	František Kardoš Jonathan Narboni
+ PDF Chat	Complex and Homomorphic Chromatic Number of Signed Planar Simple Graphs	2022	Reza Naserasr Lan Anh Pham

Works Cited by This (15)

Action	Title	Year	Authors
+	List Edge and List Total Colourings of Multigraphs	1997	O. V. Borodin Alexandr Kostochka Douglas R. Woodall
+	Group connectivity of graphs—A nonhomogeneous analogue of nowhere-zero flow properties	1992	François Jaeger Nathan Linial Charles Payan Michael Tarsi
+	Coloring Face-Hypergraphs of Graphs on Surfaces	2002	André Kündgen Radhika Ramamurthi
+	Every Planar Graph Is 5-Choosable	1994	Carsten Thomassen
+	The chromatic spectrum of signed graphs	2016	Yingli Kang Eckhard Steffen
+ PDF Chat	Colouring of generalized signed triangle-free planar graphs	2018	Yiting Jiang Daphne Der‐Fen Liu Yeong‐Nan Yeh Xuding Zhu
+ PDF Chat	The Chromatic Number of a Signed Graph	2016	Edita Máčajová André Raspaud Martin Škoviera
+	Steinberg's Conjecture is false	2016	Vincent Cohen-Addad Michael Hebdige Daniel Kráľ Zhentao Li Esteban Salgado
+ PDF Chat	Circular coloring of signed graphs	2017	Yingli Kang Eckhard Steffen
+	List-coloring embedded graphs without cycles of lengths 4 to 8	2015	Zdeněk Dvořák Luke Postle