Proof of a conjecture on the strong chromatic index of Halin graphs
From MaRDI portal
Publication:2043362
DOI10.1016/j.dam.2021.06.016zbMath1469.05061OpenAlexW3184393062WikidataQ113877229 ScholiaQ113877229MaRDI QIDQ2043362
Publication date: 2 August 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2021.06.016
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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 edge-colouring of sparse planar graphs
- Strong chromatic index of subcubic planar multigraphs
- Strong edge colouring of subcubic 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
- A bound on the strong chromatic index of a graph
- On the computational complexity of strong edge coloring
- Strong chromatic index of graphs with maximum degree four
- Upper bounds for the strong chromatic index of Halin graphs
- A polynomial time algorithm for strong edge coloring of partial \(k\)-trees
- New results on induced matchings
- The strong chromatic index of graphs with edge weight eight
- The strong edge-coloring for graphs with small edge weight
- Strong edge-coloring of pseudo-Halin graphs
- Strong edge chromatic index of the generalized Petersen graphs
- Strong edge-coloring of graphs with maximum degree 4 using 22 colors
- On strong edge-colouring of subcubic graphs
- Strong chromatic index of unit distance 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
This page was built for publication: Proof of a conjecture on the strong chromatic index of Halin graphs
