On list edge-colorings of subcubic graphs
From MaRDI portal
Publication:1584301
Recommendations
Cites work
- scientific article; zbMATH DE number 3735847 (Why is no real title available?)
- scientific article; zbMATH DE number 3563170 (Why is no real title available?)
- 25 pretty graph colouring problems
- New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
- The list chromatic index of a bipartite multigraph
Cited in
(13)- COLORING ALGORITHMS ON SUBCUBIC GRAPHS
- List star edge-coloring of subcubic graphs
- On parsimonious edge-colouring of graphs with maximum degree three
- Bridgeless cubic graphs are (7,2)-edge-choosable
- Note on list star edge‐coloring of subcubic graphs
- On strong list edge coloring of subcubic graphs
- Classes of 3-regular graphs that are (7, 2)-edge-choosable
- List-Coloring Squares of Sparse Subcubic Graphs
- Approximating the maximum 2- and 3-edge-colorable subgraph problems
- Extension from precoloured sets of edges
- Linear colorings of subcubic graphs
- Strong list edge coloring of subcubic graphs
- Sufficient conditions make graphs edge DP-\(\varDelta\)-colorable
This page was built for publication: On list edge-colorings of subcubic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584301)