A note on strong edge-coloring of claw-free cubic graphs

DOI10.1007/s12190-023-01847-xzbMath1518.05063OpenAlexW4322012298MaRDI QIDQ6138357

Zhenmeng Han, Qing Cui

Publication date: 5 September 2023

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-023-01847-x

zbMATH Keywords

claw-free graphcubic graphstrong chromatic indexstrong edge-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong chromatic index of subcubic planar multigraphs
• Strong chromatic index of \(K_{1, t}\)-free 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
• Planar graphs with maximum degree 4 are strongly 19-edge-colorable
• On strong edge-coloring of claw-free subcubic graphs
• Colouring graphs with sparse neighbourhoods: bounds and applications
• Strong edge-colouring and induced matchings
• A Stronger Bound for the Strong Chromatic Index
• Induced matchings in cubic graphs
• The tight bound for the strong chromatic indices of claw-free subcubic graphs

This page was built for publication: A note on strong edge-coloring of claw-free cubic graphs