On Edge Colorings of 1-Planar Graphs without 5-Cycles with Two Chords

Abstract

A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, it is proved that every 1-planar graph with maximum degree ∆ ≥ 8 is edge-colorable with ∆ colors if each of its 5-cycles contains at most one chord.

Keywords

• 1-planar graphs
• edge coloring
• discharging method
• 05c15