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

DOI10.1007/S10255-016-0608-3zbMATH Open1359.05041OpenAlexW2524744420MaRDI QIDQ519218FDOQ519218

Authors: Shunqin Liu, Hongliang Lu, Yuqing Lin, 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

Recommendations

• Strong edge coloring of specific planar graphs
• Strong edge-coloring of pseudo-Halin graphs
• Strong edge-coloring of planar graphs without short cycles
• Strong edge chromatic index of the generalized Petersen graphs
• Strong edge-coloring of planar graphs

zbMATH Keywords

strong chromatic indexouterplanar graphsstrong edge coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• A bound on the strong chromatic index of a graph
• Title not available (Why is that?)
• Problems and results in combinatorial analysis and graph theory
• The strong chromatic index of a cubic graph is at most 10
• Strong edge-coloring of graphs with maximum degree 4 using 22 colors
• Strong chromatic index of subset graphs
• The strong chromatic index of Halin graphs
• Induced matchings in cubic graphs
• The strong chromatic index ofC4-free graphs
• Title not available (Why is that?)
• The strong edge-coloring of Halin graphs with \(\Delta\geq 4\)
• Strong chromatic index of products of graphs

Cited In (4)

• Strong edge chromatic index of the generalized Petersen graphs
• Strong Edge Coloring of Outerplane Graphs with Independent Crossings
• Strong chromatic index of generalized Jahangir graphs and generalized Helm graphs
• Further results on strong edge-colourings in outerplanar graphs

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

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