Year: 2026
Type: preprint
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.
Source: arXiv (Cornell University)
Authors: Atminas, Aistis, Liu, Xujun, Xu, Zihui
Institution: Xi’an Jiaotong-Liverpool University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Award: G5065490023
OpenAlex ID: W7235932310
