| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8902974 | Discrete Mathematics | 2018 | 7 Pages |
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 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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Ying Wang, Wai Chee Shiu, Weifan Wang, Min Chen,