Claw-free cubic graphs are (1, 1, 1, 3)-packing edge-colorable

TL;DR

This paper proves that all claw-free cubic graphs can be edge-colored with a specific (1, 1, 1, 3)-packing scheme, confirming a conjecture for this class of graphs.

Contribution

It establishes that every claw-free cubic graph admits a (1, 1, 1, 3)-packing edge-coloring, extending the class of graphs known to have this property.

Findings

Claw-free cubic graphs admit (1, 1, 1, 3)-packing edge-colorings.

Confirms conjecture for claw-free cubic graphs.

Provides a constructive proof for the coloring scheme.

Abstract

For a non-decreasing positive integer sequence $S = (s_{1}, \dots, s_{k})$, an $S$-packing edge-coloring of a graph $G$ is a partition of the edge set of $G$ into subsets $E_{1}, \dots, E_{k}$ such that for each $1 \leq i \leq k$, the distance between any two distinct edges $e_{1}, e_{2} \in E_{i}$ is at least $s_{i} + 1$. Gastineau and Togni conjectured that cubic graphs, except the Petersen and Tietze graphs, admit $(1, 1, 1, 3)$-packing edge-colorings. In this paper, we prove that every claw-free cubic graph admits such a coloring.