On edge colorings of 1-planar graphs with 6-cycles having at most three chords

被引：0

作者：

Sun, Lin ^{[1
]}

Wu, Jian-Liang ^{[1
]}

Cai, Hua ^{[1
]}

Luo, ZhaoYang ^{[1
]}

机构：

[1] Shandong Univ, Sch Math, Jinan 250100, Peoples R China

来源：

INTERNATIONAL JOURNAL OF APPLIED MATHEMATICS & STATISTICS | 2015年 / 53卷 / 01期

关键词：

1-planar graphs; edge coloring; discharging method;

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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 6-cycles having at most three chords and with maximum degree Delta = 9 can be edge-colored by Delta colors.

引用

页码：50 / 58

页数：9

共 12 条

[1]

Bondy JA., 1976, GRADUATE TEXTS MATH

[2] Some sufficient conditions for a planar graph of maximum degree six to be Class 1 [J].