论文信息 - On the Size of Graphs of Class 2 Whose Cores have Maximum Degree Two

On the Size of Graphs of Class 2 Whose Cores have Maximum Degree Two

The core GΔ of a graph G is the subgraph of G induced by the vertices of maximum degree Δ(G). In this paper, we show that if G is a connected graph with Δ(GΔ) ≤ 2 and $${\Delta(G)\ge\frac12(|V(G)|-1)}$$, then G is of class 2 if and only if G is overfull. Our result generalizes several results of Hilton and Zhao.

Zi-Xia Song | K. M. Koh

[1] Anthony J. W. Hilton,et al. The chromatic index of a graph whose core has maximum degree two , 1992, Discret. Math..

[2] Zi-Xia Song,et al. Chromatic Index Critical Graphs of Even Order with Five Major Vertices , 2005, Graphs Comb..

[3] Anthony J. W. Hilton,et al. A sufficient condition for a regular graph to be class 1 , 1993, J. Graph Theory.

[4] Anthony J. W. Hilton,et al. The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small , 1990, J. Comb. Theory, Ser. B.

[5] H. Yap. Some Topics in Graph Theory , 1986 .

[6] Anthony J. W. Hilton,et al. The chromatic index of graphs with at most four vertices of maximum degree. , 1984 .

[7] W. T. Tutte. The Factorization of Linear Graphs , 1947 .

[8] A. Hilton,et al. Regular Graphs of High Degree are 1‐Factorizable , 1985 .

[9] Lowell W. Beineke,et al. On small graphs critical with respect to edge colourings , 1976, Discret. Math..

[10] Hian Poh Yap,et al. Chromatic index critical graphs of order 9 , 1983, Discret. Math..