Abstract

A strong t-edge-coloring of a graph H is an edge coloring with t colors, in which the edges on each path of length at most 3 receive different colors. In this article, we show that: every planar graph with girth at least 8 and maximum degree D≥4 is strong (3D−2)-edge-colorable; every planar graph with girth at least 10 and maximum degree D≥5 is strong (3D−3)-edge-colorable.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call