Double Edge Chromatic Number of p_1-Graphs
Qiaoling Ma · Journal of University of Jinan · 2009
The double-edge coloring is defined as coloring the edges of G such that arbitrary adjacent edges are assigned with distinct colors and the edges in the boundary of a face are also assigned with distinct colors.The double-edge chromatic number,χe/vf(G),is the smallest number of colors such that G admits a double edge coloring,and the upper bound of the double-edge chromatic number for all kinds of planar graphs is the focus for studying the double edge coloring.The main result of this paper is to give an upper bound,Δ(G)+1,for p1-graph,the special plane graph with high maximum degree.