On the strong chromatic index of cubic Halin graphs
From MaRDI portal
(Redirected from Publication:419099)
Recommendations
Cites work
- scientific article; zbMATH DE number 5127200 (Why is no real title available?)
- scientific article; zbMATH DE number 4187830 (Why is no real title available?)
- A polynomial time algorithm for strong edge coloring of partial \(k\)-trees
- Induced matchings
- Induced matchings in cubic graphs
- New results on induced matchings
- On the computational complexity of strong edge coloring
- The strong chromatic index of a cubic graph is at most 10
- The strong chromatic index of complete cubic Halin graphs
Cited in
(18)- Strong edge coloring of Cayley graphs and some product graphs
- On strong list edge coloring of subcubic graphs
- Strong list edge coloring of subcubic graphs
- Strong edge-coloring for cubic Halin graphs
- The strong chromatic index of complete cubic Halin graphs
- The strong edge-coloring of Halin graphs with \(\Delta\geq 4\)
- On the precise value of the strong chromatic index of a planar graph with a large girth
- The strong chromatic index of Halin graphs
- Proof of a conjecture on the strong chromatic index of Halin graphs
- Strong edge-coloring of pseudo-Halin graphs
- On star edge colorings of bipartite and subcubic graphs
- List star edge coloring of generalized Halin graphs
- The strong chromatic index of a cubic graph is at most 10
- Strong edge chromatic index of the generalized Petersen graphs
- On the inclusion chromatic index of a Halin graph
- Upper bounds for the strong chromatic index of Halin graphs
- Strong edge-coloring for jellyfish graphs
- scientific article; zbMATH DE number 5127200 (Why is no real title available?)
This page was built for publication: On the strong chromatic index of cubic Halin graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q419099)