Xin Zhang

activity

20102022

most citedStructural properties of 1-planar graphs and an application to acyclic edge coloring

9 citations · 46 across the 37 of their papers we have counts for

collaborators

Showing 2014Show all

3 papers · 1 filter

math.CO2014

The edge chromatic number of outer-1-planar graphs

Xin Zhang

A graph is outer-1-planar if it can be drawn in the plane so that all vertices are on the outer face and each edge is crossed at most once. In this paper, we completely determine t…

math.CO2014★ 1 cited

Equitable vertex arboricity of planar graphs

Xin Zhang

Let $G_{1}$ be a planar graph such that all cycles of length at most 4 are independent and let $G_{2}$ be a planar graph without 3-cycles and adjacent 4-cycles. It is proved that the s…

math.CO2014

Equitable list point arboricity of graphs

Xin Zhang

A graph $G$ is list point $k$ -arborable if, whenever we are given a $k$ -list assignment $L (v)$ of colors for each vertex $v \in V (G)$ , we can choose a color $c (v) \in L (v)$ for each…