Strong edge-colorings of sparse graphs with \(3\Delta-1\) colors

DOI10.1016/j.ipl.2022.106313OpenAlexW4292380968MaRDI QIDQ2094384

Yangfan Li, Jian-Bo Lv, Xiangwen Li, Tao Wang

Publication date: 28 October 2022

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2022.106313

zbMATH Keywords

combinatorial problemssparse graphsstrong chromatic indexdischarging methodstrong edge-coloring

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Strong edge colouring of subcubic graphs
• Problems and results in combinatorial analysis and graph theory
• The strong chromatic index of a cubic graph is at most 10
• A bound on the strong chromatic index of a graph
• Strong chromatic index of graphs with maximum degree four
• On strong edge-coloring of graphs with maximum degree 4
• Colouring graphs with sparse neighbourhoods: bounds and applications
• Strong edge-colorings of sparse graphs with large maximum degree
• On strong edge-colouring of subcubic graphs
• List strong edge coloring of some classes of graphs
• A Stronger Bound for the Strong Chromatic Index
• Induced matchings in cubic graphs

This page was built for publication: Strong edge-colorings of sparse graphs with \(3\Delta-1\) colors