A note on the strong edge-coloring of outerplanar graphs with maximum degree 3

DOI10.1007/S10255-016-0608-3zbMath1359.05041OpenAlexW2524744420MaRDI QIDQ519218

Yu-qing Lin, Hongliang Lu, Shun-yi Liu, Heping Zhang

Publication date: 4 April 2017

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-016-0608-3

zbMATH Keywords

outerplanar graphsstrong chromatic indexstrong edge coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• The strong chromatic index of Halin 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 edge-coloring of graphs with maximum degree 4 using 22 colors
• Strong chromatic index of subset graphs
• The strong chromatic index ofC4-free graphs
• Induced matchings in cubic graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on the strong edge-coloring of outerplanar graphs with maximum degree 3