Upper bounds for the strong chromatic index of Halin graphs
From MaRDI portal
Publication:1692620
DOI10.7151/dmgt.2003zbMath1377.05061OpenAlexW2725036948MaRDI QIDQ1692620
Ziyu Hu, Ko-Wei Lih, Daphne Der-Fen Liu
Publication date: 10 January 2018
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2003
Related Items (3)
Proof of a conjecture on the strong chromatic index of Halin graphs ⋮ List star edge coloring of generalized Halin graphs ⋮ Strong edge coloring of Cayley graphs and some product graphs
Cites Work
- A stronger bound for the strong chromatic index (extended abstract)
- Strong edge-coloring for cubic Halin graphs
- The strong chromatic index of Halin graphs
- On the strong chromatic index of cubic Halin graphs
- Strong chromatic index of planar graphs with large girth
- Strong edge-colouring of sparse planar graphs
- 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
- A bound on the strong chromatic index of a graph
- On the strong chromatic index of sparse graphs
- On the precise value of the strong chromatic index of a planar graph with a large girth
- New results on induced matchings
- Strong edge-coloring of graphs with maximum degree 4 using 22 colors
- On strong edge-colouring of subcubic graphs
- Induced matchings in cubic graphs
- Precise upper bound for the strong edge chromatic number of sparse planar graphs
- Strong edge-coloring of planar graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Upper bounds for the strong chromatic index of Halin graphs