1 citations · 1 across the 14 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…
cs.SI2018
On Spectral Graph Embedding: A Non-Backtracking Perspective and Graph Approximation
Fei Jiang, Lifang He, Yi Zheng +3
Graph embedding has been proven to be efficient and effective in facilitating graph analysis. In this paper, we present a novel spectral framework called NOn-Backtracking Embedding…