On the strong chromatic index of cubic Halin graphs
From MaRDI portal
Publication:419099
DOI10.1016/j.aml.2011.10.046zbMath1241.05034OpenAlexW2061170661MaRDI QIDQ419099
Ko-Wei Lih, Daphne Der-Fen Liu
Publication date: 18 May 2012
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2011.10.046
Related Items (11)
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 chromatic index of the generalized Petersen graphs ⋮ Upper bounds for the strong chromatic index of Halin graphs ⋮ Strong list edge coloring of subcubic graphs ⋮ On star edge colorings of bipartite and subcubic 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 ⋮ Strong edge coloring of Cayley graphs and some product graphs
Cites Work
- 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
- Induced matchings in cubic graphs
- Unnamed Item
- Unnamed Item
This page was built for publication: On the strong chromatic index of cubic Halin graphs
