Department of Mathematics
A strong edge-coloring of a graph is a proper edge-coloring such that edges at distance at most 2 receive different colors. It is known that every planar graph has a strong edge-coloring by using at most 4Δ + 4 colors, where Δ denotes the maximum degree of the graph. In this paper, we will show that 19 colors are enough to color a planar graph with maximum degree 4.
Strong edge-coloring, Strong chromatic index, Plane graph, Discharging method
Source Publication Title
© 2018 Elsevier B.V. All rights reserved.
Research was supported by NSFC grants (Nos. 11771402; 11471293) and Tianjin Research Program of Application Foundation and Advanced Technology (No.14JCYBJC43100).
Link to Publisher's Edition
Wang, Y., Shiu, W., Wang, W., & Chen, M. (2018). Planar graphs with maximum degree 4 are strongly 19-edge-colorable. Discrete Mathematics, 341 (6), 1629-1635. https://doi.org/10.1016/j.disc.2018.02.025
Available for download on Wednesday, July 01, 2020