9 citations · 46 across the 37 of their papers we have counts for
37 papers
Odd coloring of 2-boundary planar graphs and beyond
Weichan Liu, Mengke Qi, Xin Zhang
In this paper, we introduce the notion of 2-boundary planar graphs. A graph is 2-boundary planar if it has an embedding in the plane so that all vertices lie on the boundary of at…
Defective incidence coloring of graphs
Huimin Bi, Xin Zhang
We define the -defective incidence chromatic number of a graph, generalizing the notion of incidence chromatic number, and determine it for some classes of graphs including tree…
Conflict-free incidence coloring of outer-1-planar graphs
Mengke Qi, Xin Zhang
An incidence of a graph is a vertex-edge pair such that is incidence with . A conflict-free incidence coloring of a graph is a coloring of the incidences in such…
Counting cliques in -planar graphs
J. Pascal Gollin, Kevin Hendrey, Abhishek Methuku +2
The problem of maximising the number of cliques among -vertex graphs from various graph classes has received considerable attention. We investigate this problem for the class of…
Complexity of tree-coloring interval graphs equitably
Bei Niu, Bi Li, Xin Zhang
An equitable tree--coloring of a graph is a vertex -coloring such that each color class induces a forest and the size of any two color classes differ by at most one. In this…
Dynamic list coloring of 1-planar graphs
Xin Zhang, Yan Li
A graph is -planar if it can be drawn in the plane so that each edge is crossed at most times. Typically, the class of 1-planar graphs is among the most investigated graph f…