Edge colorings of embedded graphs
The authors give some conditions for a graph to be embeddable in a surface with Eulerian negative characteristic and to have as chromatic index the maximum degree of its vertices.
scientific article; zbMATH DE number 1491664