25 citations · 45 across the 17 of their papers we have counts for
Showing 2011Show all
3 papers · 1 filter
math.CO2011★ 1 cited
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…
math.CO2011
(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…
math.CO2011★ 1 cited
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 $…