Hits :

First Author : Huang, Danjun

Affiliation of Author(s): 数理与信息工程学院

Date of Publication : 2012-01-01

Document Type : 期刊

Journal : Electron. J. Combin.

Volume: Vol.19

Issue : No.3

Page Number : 17

ISSN : 1077-8926

Translation or Not : no

Key Words : Planar;graph;edge;coloring;class;one;cycle

Abstract : It is conjectured by Vizing (1965) that every planar graphs graph G with maximum degree 6 <= Delta <= 7 is class one. The case Delta = 7 was confirmed independently by Sanders and Zhao (2001), and by Zhang (2000). In this paper, we prove that every planar