The strong chromatic index of Halin graphs

DOI10.1016/j.disc.2011.09.016zbMath1239.05071OpenAlexW2040612528MaRDI QIDQ411659

Ping-Ying Tsai, Ko-Wei Lih, Hsin-Hao Lai

Publication date: 30 April 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.09.016

zbMATH Keywords

strong chromatic indexHalin graphstrong edge coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

On the \(A_\alpha\)- spectral radius of Halin graphs ⋮ On connected graphs having the maximum connective eccentricity index ⋮ Extremal Halin graphs with respect to the signless Laplacian spectra ⋮ On the precise value of the strong chromatic index of a planar graph with a large girth ⋮ Strong edge chromatic index of the generalized Petersen graphs ⋮ Upper bounds for the strong chromatic index of Halin graphs ⋮ Group chromatic number of Halin graphs ⋮ A note on the strong edge-coloring of outerplanar graphs with maximum degree 3 ⋮ Strong edge-coloring for jellyfish graphs ⋮ Some further results on the eccentric distance sum ⋮ Proof of a conjecture on the strong chromatic index of Halin graphs ⋮ Strong edge-coloring of pseudo-Halin graphs ⋮ List star edge coloring of generalized Halin graphs ⋮ Strong edge coloring of Cayley graphs and some product graphs

Cites Work

• Unnamed Item
• Unnamed Item
• The strong chromatic index of complete cubic Halin graphs
• The strong chromatic index of a cubic graph is at most 10
• Induced matchings
• On the computational complexity of strong edge coloring
• A polynomial time algorithm for strong edge coloring of partial \(k\)-trees
• New results on induced matchings
• Vertex-distinguishing proper edge-colorings
• The strong chromatic index ofC4-free graphs
• Induced matchings in cubic graphs