Coloring edges of embedded graphs
Abbreviated Journal Title
J. Graph Theory
edge colorings; class one and class two; Mathematics
In this paper, we prove that any graph G with maximum degree Delta>(*) over bar * (G) greater than or equal to (11+root 49-24 chi>(*) over bar *(Sigma))/2, which is embeddable in a surface Sigma of characteristic chi>(*) over bar *(Sigma) less than or equal to 1 and satisfies \V(G)\ > 2(Delta>(*) over bar * (G)-5)-2 root6+Delta>(*) over bar * (G), is class one, (C) 2000 John Wiley & Sons, Inc.
Journal of Graph Theory
"Coloring edges of embedded graphs" (2000). Faculty Bibliography 2000s. 2788.