no. 17 · Wednesday 18 November 2026
Between proper and strong edge-colorings of graphs with maximum degree at most four
Abstract
A $(1^j,2^k)$-packing edge-coloring of a graph $G$ is a partition of its edge set $E(G)$ into $j$ matchings and $k$ induced matchings. It can be viewed as intermediate colorings between proper and strong edge-coloring. The study of this topic on subcubic graphs has drawn considerable attention recently, with many conjectures and open problems proposed and resolved. However, very few results are known for graphs with maximum degree four or more. Henderson, Kennedy, and Santana showed that every graph with degree at most four has a $(1,2^{19})$-packing edge-coloring and a $(1^2,2^{17})$-packing edge-coloring. In this paper, we improve the results of Henderson, Kennedy, and Santana by showing every graph with degree at most four has a $(1,2^{17})$-packing edge-coloring. As a corollary of our result, every graph with degree at most four has a $(1^2,2^{16})$-packing edge-coloring.
- comments
- 12 pages, 8 figures
- fields
- Combinatorics