On edge colorings of 1-planar graphs

Authors:
Xin Zhang;Jian-Liang Wu
Affiliations:
School of Mathematics, Shandong University, Jinan 250100, China;School of Mathematics, Shandong University, Jinan 250100, China
Venue:
Information Processing Letters
Year:
2011

Citing 3
Cited 3

Some topics in graph theory

Some topics in graph theory
Planar graphs of maximum degree seven are Class I

Journal of Combinatorial Theory Series B
Graph Theory With Applications

Graph Theory With Applications

On edge colorings of 1-planar graphs without adjacent triangles

Information Processing Letters
A note on total colorings of 1-planar graphs

Information Processing Letters
A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system

Theoretical Computer Science

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 shown that every 1-planar graph with maximum degree @D=10 can be edge-colored with @D colors.