Strong list edge coloring of subcubic graphs
From MaRDI portal
(Redirected from Strong list edge coloring of subcubic graphs)
Summary: We study strong list edge coloring of subcubic graphs, and we prove that every subcubic graph with maximum average degree less than 15/7, 27/11, 13/5, and 36/13 can be strongly list edge colored with six, seven, eight, and nine colors, respectively.
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?)
- On the strong chromatic index of cubic Halin graphs
- Strong edge colouring of subcubic graphs
- The strong chromatic index of a cubic graph is at most 10
- The strong chromatic index of complete cubic Halin graphs
Cited in
(12)- On list edge-colorings of subcubic graphs
- Strong list-chromatic index of subcubic graphs
- On strong edge-colouring of subcubic graphs
- List-Coloring Squares of Sparse Subcubic Graphs
- On strong list edge coloring of subcubic graphs
- Note on list star edge‐coloring of subcubic graphs
- A note on strong edge choosability of toroidal subcubic graphs
- A \((1,0)\)-relaxed strong list coloring of planar subcubic graphs
- Recent progress on strong edge-coloring of graphs
- Strong list-chromatic index of planar graphs with Ore-degree at most seven
- List strong edge-colorings of sparse graphs
- Strong edge colouring of subcubic graphs
This page was built for publication: Strong list edge coloring of subcubic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q460435)
