The strong chromatic index of complete cubic Halin graphs

DOI10.1016/j.aml.2008.08.019zbMath1180.05048OpenAlexW2053935492MaRDI QIDQ1021818

W. K. Tam, Wai Chee Shiu

Publication date: 9 June 2009

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2008.08.019

zbMATH Keywords

edge-coloringstrong chromatic indexHalin graphcubic treecomplete cubic Halin graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (12)

On the precise value of the strong chromatic index of a planar graph with a large girth ⋮ On strong list edge coloring of subcubic graphs ⋮ Strong edge-coloring for cubic Halin graphs ⋮ Strong edge chromatic index of the generalized Petersen graphs ⋮ Injective edge coloring of power graphs and necklaces ⋮ The strong chromatic index of Halin graphs ⋮ Upper bounds for the strong chromatic index of Halin graphs ⋮ On the strong chromatic index of cubic Halin graphs ⋮ Strong list edge coloring of subcubic graphs ⋮ Strong edge-coloring for jellyfish graphs ⋮ Proof of a conjecture on the strong chromatic index of Halin graphs ⋮ List star edge coloring of generalized Halin graphs

Cites Work

• 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
• The strong chromatic index ofC4-free graphs
• Induced matchings in cubic graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The strong chromatic index of complete cubic Halin graphs