On edge colorings of 1-planar graphs without adjacent triangles

Authors:
Xin Zhang;Guizhen Liu
Affiliations:
School of Mathematics, Shandong University, Jinan 250100, PR China;School of Mathematics, Shandong University, Jinan 250100, PR China
Venue:
Information Processing Letters
Year:
2012

Citing 3
Cited 1

Planar graphs of maximum degree seven are Class I

Journal of Combinatorial Theory Series B
The size of edge chromatic critical graphs with maximum degree 6

Journal of Graph Theory
On edge colorings of 1-planar graphs

Information Processing Letters

A note on total colorings of 1-planar graphs

Information Processing Letters

Quantified Score

Hi-index	0.89

Visualization

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 without adjacent triangles and with maximum degree @D=8 can be edge-colored with @D colors.