Planar graphs of maximum degree seven are Class I

A note on graphs of class I

Discrete Mathematics

Coloring edges of graphs embedded in a surface of characteristic zero

Journal of Combinatorial Theory Series B

A self-stabilizing (Δ+4)-edge-coloring algorithm for planar graphs in anonymous uniform systems

Information Processing Letters

A sufficient condition for a planar graph to be class 1

Theoretical Computer Science

Finding the exact bound of the maximum degrees of class two graphs embeddable in a surface of characteristic ε∈{-1,-2,-3}

Journal of Combinatorial Theory Series B

Chromatic index of graphs with no cycle with a unique chord

Theoretical Computer Science

On edge colorings of 1-planar graphs

Information Processing Letters

Entire colouring of plane graphs

Journal of Combinatorial Theory Series B

On edge colorings of 1-planar graphs without adjacent triangles

Information Processing Letters

On r-acyclic edge colorings of planar graphs

Discrete Applied Mathematics

Survey: Randomly colouring graphs (a combinatorial view)

Computer Science Review

Note: A sufficient condition for a plane graph with maximum degree 6 to be class 1

Discrete Applied Mathematics

Note: Edge coloring of planar graphs which any two short cycles are adjacent at most once

Theoretical Computer Science

Note: Edge colorings of planar graphs without 5-cycles with two chords

Theoretical Computer Science