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.

Subjects

GRAPH connectivity; BIPARTITE graphs; SUBGRAPHS; DIRECTED graphs; GEOMETRIC vertices

Publication

Discussiones Mathematicae: Graph Theory, 2019, Vol 39, Issue 2, p301

ISSN

1234-3099

Publication type

Academic Journal

DOI

10.7151/dmgt.2072