1 citations · 1 across the 1 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
math.CO2018
On a Sufficient Condition for Planar Graphs of Maximum Degree 6 to be Totally 7-Colorable
Enqiang Zhu, Chanjuan Liu, Yongsheng Rao
A total -coloring of a graph is an assignment of colors to its vertices and edges such that no two adjacent or incident elements receive the same color. The Total Coloring C…
math.CO2018
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(…