2 citations · 3 across the 4 of their papers we have counts for
4 papers
The characterization of perfect Roman domination stable trees
Zepeng Li, Zehui Shao, Yongsheng Rao +2
A \emph{perfect Roman dominating function} (PRDF) on a graph is a function satisfying the condition that every vertex for which $f(…
On uniquely 3-colorable plane graphs without prescribed adjacent faces
Zepeng Li, Naoki Matsumoto, Enqiang Zhu +2
A graph is \emph{uniquely k-colorable} if the chromatic number of is and has only one -coloring up to permutation of the colors. For a plane graph , two faces…
Tree-colorable maximal planar graphs
Enqiang Zhu, Zepeng Li, Zehui Shao +1
A tree-coloring of a maximal planar graph is a proper vertex -coloring such that every bichromatic subgraph, induced by this coloring, is a tree. A maximal planar graph is t…
Size of edge-critical uniquely 3-colorable planar graphs
Zepeng Li, Enqiang Zhu, Zehui Shao +1
A graph is \emph{uniquely k-colorable} if the chromatic number of is and has only one -coloring up to permutation of the colors. A uniquely -colorable graph $…