Planar graphs with maximum degree 4 are strongly 19-edge-colorable |
| |
| Authors: | Ying Wang Wai Chee Shiu Weifan Wang Min Chen |
| |
| Affiliation: | 1. Department of Mathematics, Zhejiang Normal University, Jinhua 321004, China;2. Department of Mathematics, Hong Kong Baptist University, 224 Waterloo Road, Kowloon Tong, Hong Kong, China |
| |
| Abstract: | 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 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. |
| |
| Keywords: | Strong edge-coloring Strong chromatic index Plane graph Discharging method |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
