Year: 2026
Type: preprint
Abstract: A rich-neighbour edge-colouring is a proper edge-colouring in which every non-isolated edge has an adjacent edge whose neighbours have pairwise distinct colours. Petruševski and Škrekovski conjectured that every connected subcubic loopless multigraph distinct from $K_4$ admits such a colouring with five colours. We prove the conjecture for two classes: claw-free subcubic loopless multigraphs and $2$-connected subcubic outerplanar loopless multigraphs. The bound is sharp in both classes, as witnessed by the diamond $K_4-e$.
Source: arXiv (Cornell University)
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7236851509
