3 citations · 6 across the 16 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
math.CO2020
Overfullness of critical class 2 graphs with a small core degree
Yan Cao, Guantao Chen, Songling Shan
Let be a simple graph, and let , and be the order, the maximum degree and the chromatic index of , respectively. We call overfull if $|E(G)|/\lfloor n…
math.CO2020
-critical graphs with a vertex of degree 2
Yan Cao, Guantao Chen, Songling Shan
Let be a simple graph with maximum degree . A classic result of Vizing shows that , the chromatic index of , is either or . We say is of \emph{Class 1…
math.CO2020★ 3 cited
Proof of the Core Conjecture of Hilton and Zhao
Yan Cao, Guantao Chen, Guangming Jing +1
Let be a simple graph with maximum degree . We call \emph{overfull} if . The \emph{core} of , denoted , is the subgraph of i…