9 citations · 46 across the 37 of their papers we have counts for
8 papers · 1 filter
Total coloring of pseudo-outerplanar graphs
Xin Zhang, Guizhen Liu
A graph is pseudo-outerplanar if each of its blocks has an embedding in the plane so that the vertices lie on a fixed circle and the edges lie inside the disk of this circle with e…
Edge covering pseudo-outerplanar graphs with forests
Xin Zhang, Guizhen Liu, Jian-Liang Wu
A graph is called pseudo-outerplanar if each block has an embedding on the plane in such a way that the vertices lie on a fixed circle and the edges lie inside the disk of this cir…
(1,λ)-embedded graphs and the acyclic edge choosability
Xin Zhang, Guizhen Liu, Jian-Liang Wu
A (1,λ)-embedded graph is a graph that can be embedded on a surface with Euler characteristic λ so that each edge is crossed by at most one other edge. A graph G is called α-linear…
(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…