3 citations · 4 across the 7 of their papers we have counts for
4 papers · 1 filter
List version of (,1)-total labellings
Yong Yu, Guanghui Wang, Guizhen Liu
The (,1)-total number of a graph is the width of the smallest range of integers that suffices to label the vertices and the edges of such that no two adjacent…
List (d,1)-total labelling of graphs embedded in surfaces
Yong Yu, Xin Zhang, Guizhen Liu
The (d,1)-total labelling of graphs was introduced by Havet and Yu. In this paper, we consider the list version of (d,1)-total labelling of graphs. Let G be a graph embedded in a s…
k-forested choosability of graphs with bounded maximum average degree
Xin Zhang, Guizhen Liu, Jian-Liang Wu
A proper vertex coloring of a simple graph is -forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than . A graph is $…
Group edge choosability of planar graphs without adjacent short cycles
Xin Zhang, Guizhen Liu
In this paper, we aim to introduce the group version of edge coloring and list edge coloring, and prove that all 2-degenerate graphs along with some planar graphs without adjacent…