This is the authors' abstract. We don't add key points for this paper.
In a proper edge-coloring, an edge is rich if its neighboring edges have pairwise distinct colors. A rich-neighbor edge-coloring requires every nonisolated edge to be adjacent to a rich edge. We introduce a related, incomparable notion: a rich edge-coloring is a proper edge-coloring in which every nonisolated vertex is incident with a rich edge. Five colors do not suffice for all subcubic graphs: the graph obtained from K 4 by subdividing one edge exactly once has rich chromatic index 6. We conjecture that this is the only connected subcubic graph whose rich chromatic index exceeds 5. We verify the conjecture for subcubic graphs without adjacent 3-vertices and for subcubic K 4 -minor-free graphs.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Deng et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: