Edge Coloring of Triangle-Free 1-Planar Graphs

Xin Zhang; Guizhen Liu; Jian-Liang Wu

Edge Coloring of Triangle-Free 1-Planar Graphs

Combinatorics 2010-12-30 v1 Discrete Mathematics

Authors: Xin Zhang , Guizhen Liu , Jian-Liang Wu

Abstract

it is shown that each triangle-free 1-planar graph with maximum degree $\Delta\geq7$ can be $\Delta$ -colorable by Discharging Method.

Keywords

graph coloring

Cite

@article{arxiv.1012.5921,
  title  = {Edge Coloring of Triangle-Free 1-Planar Graphs},
  author = {Xin Zhang and Guizhen Liu and Jian-Liang Wu},
  journal= {arXiv preprint arXiv:1012.5921},
  year   = {2010}
}

Comments

Please cite this paper as X. Zhang, G. Liu and J.-L. Wu. Edge coloring of triangle-free 1-planar graphs. Journal of Shandong University (Natural Science), 45(6): 15-17, 2010

Edge Coloring of Triangle-Free 1-Planar Graphs

Abstract

Keywords

Cite

Comments

Related papers