On the Size of Graphs of Class 2 Whose Cores have Maximum Degree Two
Abbreviated Journal Title
Edge coloring; Chromatic index; Overfull; INDEX CRITICAL GRAPHS; CHROMATIC INDEX; VERTICES; Mathematics
The core G (Delta) of a graph G is the subgraph of G induced by the vertices of maximum degree Delta(G). In this paper, we show that if G is a connected graph with Delta(G (Delta)) a parts per thousand currency sign 2 and , then G is of class 2 if and only if G is overfull. Our result generalizes several results of Hilton and Zhao.
Graphs and Combinatorics
"On the Size of Graphs of Class 2 Whose Cores have Maximum Degree Two" (2013). Faculty Bibliography 2010s. 4231.