9 citations · 29 across the 12 of their papers we have counts for
7 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…
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 $…