Strong edge-coloring for cubic Halin graphs

DOI10.1016/j.disc.2012.01.014zbMath1237.05069OpenAlexW1966127312MaRDI QIDQ408187

Daphne Der-Fen Liu, Gerard Jennhwa Chang

Publication date: 29 March 2012

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

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

zbMATH Keywords

cubic graphsHalin graphsstrong chromatic indexstrong edge-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

On the \(A_\alpha\)- spectral radius of Halin graphs ⋮ On the precise value of the strong chromatic index of a planar graph with a large girth ⋮ Upper bounds for the strong chromatic index of Halin graphs ⋮ Distance two edge labelings of lattices ⋮ Group chromatic number of Halin graphs ⋮ Strong edge-coloring for jellyfish graphs ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The strong chromatic index of a class of graphs
• The strong chromatic index of complete cubic Halin graphs
• Problems and results in combinatorial analysis and graph theory
• The strong chromatic index of a cubic graph is at most 10
• Induced matchings
• Incidence and strong edge colorings of graphs
• On the computational complexity of strong edge coloring
• The incidence coloring conjecture for graphs of maximum degree 3
• A polynomial time algorithm for strong edge coloring of partial \(k\)-trees
• New results on induced matchings
• Strong edge-coloring of graphs with maximum degree 4 using 22 colors
• Induced matchings in cubic graphs