3 citations · 6 across the 6 of their papers we have counts for
6 papers
(2,1)-Total labeling of planar graphs with large maximum degree
Yong Yu, Xin Zhang, Guanghui Wang +1
The (,1)-total labelling of graphs was introduced by Havet and Yu. In this paper, we prove that, for planar graph with maximum degree and , the (2,1)-total la…
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…
Class two 1-planar graphs with maximum degree six or seven
Xin Zhang
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this note we give examples of class two 1-planar graphs with maximum…
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…
Edge Coloring of Triangle-Free 1-Planar Graphs
Xin Zhang, Guizhen Liu, Jian-Liang Wu
it is shown that each triangle-free 1-planar graph with maximum degree can be -colorable by Discharging Method.