9 citations · 46 across the 37 of their papers we have counts for
4 papers · 1 filter
Drawing complete multipartite graphs on the plane with restrictions on crossings
Xin Zhang
We introduce the concept of NIC-planar graphs and present the full characterization of NIC-planar complete k-partite graphs.
On r-equitable chromatic threshold of Kronecker products of complete graphs
Wei Wang, Zhidan Yan, Xin Zhang
A graph is -equitably -colorable if its vertex set can be partitioned into independent sets, any two of which differ in size by at most . The -equitable chromat…
List total coloring of pseudo-outerplanar graphs
Xin Zhang
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…
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…