Edge Coloring of Triangle-Free 1-Planar Graphs

Details Edge Coloring of Triangle-Free 1-Planar Graphs Edge Coloring of Triangle-Free 1-Planar Graphs

2010-12-29

arxiv.org/abs/1012.5921v1

Mathematics

Combinatorics

Please cite this paper as X. Zhang, G. Liu and J.-L. Wu. Edge coloring of triangle-free 1-planar graphs. Journal of Shandong U

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

Edge Coloring of Triangle-Free 1-Planar Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Edge Coloring of Triangle-Free 1-Planar Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Edge Coloring of Triangle-Free 1-Planar Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-610722