On strong edge-coloring of claw-free subcubic graphs
From MaRDI portal
Publication:2117528
Recommendations
Cites work
- scientific article; zbMATH DE number 3882451 (Why is no real title available?)
- scientific article; zbMATH DE number 3851125 (Why is no real title available?)
- A bound on the strong chromatic index of a graph
- A stronger bound for the strong chromatic index (extended abstract)
- Induced matchings in cubic graphs
- On strong edge-coloring of graphs with maximum degree 4
- Problems and results in combinatorial analysis and graph theory
- Strong chromatic index of \(K_{1, t}\)-free graphs
- Strong chromatic index of graphs with maximum degree four
- The strong chromatic index of a cubic graph is at most 10
Cited in
(5)- On strong edge-coloring of graphs with maximum degree 5
- The tight bound for the strong chromatic indices of claw-free subcubic graphs
- Strong edge chromatic index of the generalized Petersen graphs
- Strong edge colorings of graphs and the covers of Kneser graphs
- A note on strong edge-coloring of claw-free cubic graphs
This page was built for publication: On strong edge-coloring of claw-free subcubic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117528)