Your institution may have access to this item. Find your institution then sign in to continue.
Title
ON EDGE COLORINGS OF 1-PLANAR GRAPHS WITHOUT 5-CYCLES WITH TWO CHORDS.
Authors
LIN SUN; JIANLIANG WU
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.