|
|||||
|
|
Coloring edges of embedded graphs |
|
| Authors: | Daniel P Sanders Yue Zhao |
| Abstract: | In this paper, we prove that any graph G with maximum degree  , which is embeddable in a surface Σ of characteristic χ(Σ) ≤ 1 and satisfies  , is class one. © 2000 John Wiley & Sons, Inc. J Graph Theory 35: 197–205, 2000 |
| Keywords: | edge colorings class one and class two |