Answers are grounded in this paper and cite their sources.
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₄ 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₄-e.
No takes yet. Share an insight, caveat, or question.
Kashima et al. (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: