Jialu Zhu

Generating author description...

All published works

Action	Title	Year	Authors
+	Minimum non-chromatic-choosable graphs with given chromatic number	2024	Jialu Zhu Xuding Zhu
+	The circular chromatic number of signed series–parallel graphs of given girth	2023	Jialu Zhu Xuding Zhu
+	Bad list assignments for non‐k $k$‐choosable k $k$‐chromatic graphs with 2k+2 $2k+2$‐vertices	2023	Jialu Zhu Xuding Zhu
+	Minimum non-chromatic-λ-choosable graphs	2023	Jialu Zhu Xuding Zhu
+	Weak$^$ degeneracy and weak$^$ $k$-truncated-degree-degenerate graphs	2023	Huan‐Xiang Zhou Jialu Zhu Xuding Zhu
+	Minimum non-chromatic-choosable graphs with given chromatic number	2022	Jialu Zhu Xuding Zhu
+	Bad list assignments for non-$k$-choosable $k$-chromatic graphs with $2k+2$-vertices	2022	Jialu Zhu Xuding Zhu
+	Minimum non-chromatic-$λ$-choosable graphs	2022	Jialu Zhu Xuding Zhu
+	The fractional chromatic number of double cones over graphs	2021	Jialu Zhu Xuding Zhu
+	Chromatic $\lambda$-choosable and $\lambda$-paintable graphs	2019	Jialu Zhu Xuding Zhu
+	Chromatic $λ$-choosable and $λ$-paintable graphs	2019	Jialu Zhu Xuding Zhu

Common Coauthors

Coauthor	Papers Together
Xuding Zhu	11
Huan‐Xiang Zhou	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ 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	3
+ PDF Chat	A Proof of a Conjecture of Ohba	2014	Jonathan A. Noel Bruce A. Reed Hehui Wu	2
+	Towards an on-line version of Ohba’s conjecture	2013	Jakub Kozik Piotr Micek Xuding Zhu	2
+	A refinement of choosability of graphs	2019	Xuding Zhu	2
+	List-colourings of graphs	1985	B Bollobás A. J. Harris	2
+	On chromatic‐choosable graphs	2002	Kyoji Ohba	2
+ PDF Chat	Chip Games and Paintability	2016	Lech Duraj Grzegorz Gutowski Jakub Kozik	2
+	Several parameters of generalized Mycielskians	2005	Wensong Lin Jianzhuan Wu Peter Che Bor Lam Guohua Gu	1
+	List Colouring When The Chromatic Number Is Close To the Order Of The Graph	2004	Bruce Reed Benny Sudakov	1
+	Ohba’s conjecture for graphs with independence number five	2011	Alexandr Kostochka Michael Stiebitz Douglas R. Woodall	1
+ PDF Chat	Bipartite Graphs whose Squares are not Chromatic-Choosable	2015	Seog‐Jin Kim Boram Park	1
+ PDF Chat	The Chromatic Number of a Signed Graph	2016	Edita Máčajová André Raspaud Martin Škoviera	1
+ PDF Chat	Circular coloring of signed graphs	2017	Yingli Kang Eckhard Steffen	1
+	On the 4-color theorem for signed graphs	2020	František Kardoš Jonathan Narboni	1
+ PDF Chat	Circular Chromatic Number of Signed Graphs	2021	Reza Naserasr Zhouningxin Wang Xuding Zhu	1
+	Minimum non-chromatic-choosable graphs with given chromatic number	2022	Jialu Zhu Xuding Zhu	1
+	Bad list assignments for non-$k$-choosable $k$-chromatic graphs with $2k+2$-vertices	2022	Jialu Zhu Xuding Zhu	1
+ PDF Chat	Proof of the List Edge Coloring Conjecture for Complete Graphs of Prime Degree	2014	Uwe Schauz	1
+	Refined list version of Hadwiger’s Conjecture	2023	Yangyan Gu Yiting Jiang David R. Wood Xuding Zhu	1
+ PDF Chat	Counterexamples to the List Square Coloring Conjecture	2014	Seog‐Jin Kim Boram Park	1
+	Beyond Ohba's Conjecture: A bound on the choice number of $k$-chromatic graphs with $n$ vertices	2013	Jonathan A. Noel Douglas B. West Hehui Wu Xuding Zhu	1
+	Some upper bounds on the total and list chromatic numbers of multigraphs	1992	Roland Häggkvist Amanda G. Chetwynd	1
+	On the choosability of complete multipartite graphs with part size three	2000	H. A. Kierstead	1
+	Ohba’s conjecture is true for graphs with independence number at most three	2009	Yufa Shen Wenjie He Guoping Zheng LI Yan-po	1
+	Choice number of 3-colorable elementary graphs	1997	Sylvain Gravier Frédéric Maffray	1