A note on the strong edge-coloring of outerplanar graphs with maximum degree 3
From MaRDI portal
(Redirected from Publication:519218)
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 bound on the strong chromatic index of a graph
- Induced matchings in cubic graphs
- Problems and results in combinatorial analysis and graph theory
- Strong chromatic index of products of graphs
- Strong chromatic index of subset graphs
- Strong edge-coloring of graphs with maximum degree 4 using 22 colors
- The strong chromatic index of Halin graphs
- The strong chromatic index of a cubic graph is at most 10
- The strong chromatic index ofC4-free graphs
- The strong edge-coloring of Halin graphs with \(\Delta\geq 4\)
Cited in
(4)
This page was built for publication: A note on the strong edge-coloring of outerplanar graphs with maximum degree 3
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q519218)