论文信息 - Edge-coloring critical graphs with high degree

Edge-coloring critical graphs with high degree

It is proved here that any edge-coloring critical graph of order n and maximum degree Δ ≥ 8 has the size at least 3(n + Δ - 8). It generalizes a result of Hugh Hind and Yue Zhao.

Lianying Miao | Jian-Liang Wu

[1] Yue Zhao,et al. Edge colorings of graphs embeddable in a surface of low genus , 1998, Discret. Math..

[2] L. S. Mel'nikov. The chromatic class and the location of a graph on a closed surface , 1970 .

[3] V. G. Vizing. SOME UNSOLVED PROBLEMS IN GRAPH THEORY , 1968 .

[4] Yue Zhao,et al. Edge Colorings of Embedded Graphs , 2000, Graphs Comb..

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

[6] Hian Poh Yap,et al. On graphs critical with respect to edge-colourings , 1981, Discret. Math..