Strong edge-coloring of some sparse graphs
From MaRDI portal
Recommendations
Cites work
- A bound on the strong chromatic index of a graph
- A stronger bound for the strong chromatic index (extended abstract)
- Colouring graphs with sparse neighbourhoods: bounds and applications
- scientific article; zbMATH DE number 3882451 (Why is no real title available?)
- Induced matchings in cubic graphs
- On strong edge-coloring of graphs with maximum degree 4
- On strong edge-colouring of subcubic graphs
- Strong chromatic index of graphs with maximum degree four
- Strong edge-coloring for jellyfish graphs
- Strong edge-colorings of sparse graphs with large maximum degree
- Strong edge-colouring and induced matchings
- The strong chromatic index of a cubic graph is at most 10
Cited in
(11)- Strong edge-colorings of sparse graphs with \(3\Delta-1\) colors
- Strong edge-colorings of sparse graphs with large maximum degree
- Strong edge-coloring for jellyfish graphs
- Restricted extension of sparse partial edge colorings of complete graphs
- Strong edge coloring sparse graphs
- Strong edge-colouring of sparse planar graphs
- Precise upper bound for the strong edge chromatic number of sparse planar graphs
- On strongly spanning k-edge-colorable subgraphs
- On strong edge-coloring of graphs with maximum degree 5
- Strong edge coloring of subquartic graphs
- Strong edge chromatic index of subquartic graphs
This page was built for publication: Strong edge-coloring of some sparse graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6162646)
