9 citations · 29 across the 12 of their papers we have counts for
12 papers
On total colorings of 1-planar graphs
Xin Zhang, Jianfeng Hou, Guizhen Liu
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 paper, we confirm the total-coloring conjecture for 1-planar gra…
Long properly colored cycles in edge colored complete graphs
Guanghui Wang, Tao Wang, Guizhen Liu
Let denote a complete graph on vertices whose edges are colored in an arbitrary way. Let denote the maximum number of edges of the sa…
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…