|
|||||
|
|
ContributionsEdge colorings of graphs embeddable in a surface of low genus |
|
| Authors: | Hugh Hind and Yue Zhao |
| Institution: | Department of Combinatorics & Optimization, University of Waterloo, Waterloo, Ont., Canada N2L 3G1 |
| Abstract: | In this paper, by using the Discharging Method, we show that any graph with maximum degree Δ  8 that is embeddable in a surface Σ of characteristic χ(Σ) 0 is class one and any graph with maximum degree Δ 9 that is embeddable in a surface Σ of characteristic χ(Σ) = ? 1 is class one. For surfaces of characteristic 0 or ?1, these results improve earlier results of Mel'nikov. |
| Keywords: | Edge colorings Class one and class two |
| 本文献已被 ScienceDirect 等数据库收录！ | |