42 citations · 153 across the 70 of their papers we have counts for
8 papers · 1 filter
On Hedetniemi's conjecture and the Poljak-Rodl function
Xuding Zhu
Hedetniemi conjectured in 1966 that for any graphs G and H. Here is the graph with vertex set defined by putting…
The Alon-Tarsi number of planar graphs without cycles of lengths and
Huajing Lu, Xuding Zhu
This paper proves that if is a planar graph without 4-cycles and -cycles for some , then there exists a matching such that . This implies…
Chromatic -choosable and -paintable graphs
Jialu Zhu, Xuding Zhu
Let be the minimum number of vertices in a non--choosable -chromatic graph. The Ohba conjecture, confirmed by Noel, Reed and Wu, asserts that . This bou…
Strong fractional choice number of series-parallel graphs
Xuer Li, Xuding Zhu
The strong fractional choice number of a graph is the infimum of those real numbers such that is -choosable for every positive integer . The s…
List colouring triangle free planar graphs
Jianzhang Hu, Xuding Zhu
This paper proves the following result: Assume is a triangle free planar graph, is an independent set of . If is a list assignment of such that $\mid L(v)\mid =…
A note about online nonrepetitive coloring -trees
Balázs Keszegh, Xuding Zhu
We prove that it is always possible to color online nonrepetitively any (partial) -tree (that is, graphs with tree-width at most ) with colors. This implies that it is…