Edge Coloring of Triangle-Free 1-Planar Graphs
arXiv:1012.5921
Abstract
it is shown that each triangle-free 1-planar graph with maximum degree can be -colorable by Discharging Method.
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