Strong edge chromatic index of subquartic graphs

DOI10.1007/S10878-026-01390-YMaRDI QIDQ7314347zbMATH OpenFDO

Authors Junlei Zhu, Hongguo Zhu, Yuehua Bu

Publication date 14 August 2026

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10878-026-01390-Y

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35)

Cites work

• A bound on the strong chromatic index of a graph
• A stronger bound for the strong chromatic index
• Colouring graphs with sparse neighbourhoods: bounds and applications
• scientific article; zbMATH DE number 3851125 (Why is no real title available?)
• Induced matchings in cubic graphs
• List strong edge coloring of some classes of graphs
• On strong edge-coloring of graphs with maximum degree 4
• On strong edge-coloring of graphs with maximum degree 5
• On strong edge-colouring of subcubic graphs
• On the computational complexity of strong edge coloring
• Strong chromatic index of graphs with maximum degree four
• Strong edge coloring of subquartic graphs
• Strong edge coloring sparse graphs
• Strong edge-coloring of graphs with maximum degree 4 using 22 colors
• Strong edge-coloring of some sparse graphs
• Strong edge-colorings of sparse graphs with \(3\Delta-1\) colors
• Strong edge-colorings of sparse graphs with large maximum degree
• The strong chromatic index of a cubic graph is at most 10

This page was built for publication: Strong edge chromatic index of subquartic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7314347)