Strong edge-coloring of subcubic planar graphs

DOI10.1142/S1793830917500136zbMath1360.05052MaRDI QIDQ2966513

Hongguo Zhu, Yuehua Bu

Publication date: 7 March 2017

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

cyclesgirthplanar graphsubcubic graphstrong edge-coloring

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Optimal channel assignment and \(L(p,1)\)-labeling ⋮ Minimum 2-distance coloring of planar graphs and channel assignment

Cites Work

• Unnamed Item
• A stronger bound for the strong chromatic index (extended abstract)
• Strong edge colouring of subcubic graphs
• 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
• On strong edge-colouring of subcubic graphs
• Induced matchings in cubic graphs
• Precise upper bound for the strong edge chromatic number of sparse planar graphs
• Strong edge-coloring of planar graphs

This page was built for publication: Strong edge-coloring of subcubic planar graphs