On list edge-colorings of subcubic graphs
From MaRDI portal
Publication:1584301
Recommendations
Cites work
- 25 pretty graph colouring problems
- scientific article; zbMATH DE number 3735847 (Why is no real title available?)
- scientific article; zbMATH DE number 3563170 (Why is no real title available?)
- 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
(14)- List star edge-coloring of subcubic graphs
- Extension from precoloured sets of edges
- On parsimonious edge-colouring of graphs with maximum degree three
- Linear colorings of subcubic graphs
- Bridgeless cubic graphs are (7,2)-edge-choosable
- Classes of 3-regular graphs that are (7, 2)-edge-choosable
- List-Coloring Squares of Sparse Subcubic Graphs
- On strong list edge coloring of subcubic graphs
- Strong list edge coloring of subcubic graphs
- Note on list star edge‐coloring of subcubic graphs
- COLORING ALGORITHMS ON SUBCUBIC GRAPHS
- Sufficient conditions make graphs edge DP--colorable
- Edge DP-coloring of planar graphs without 4-cycles and specific cycles
- Approximating the maximum 2- and 3-edge-colorable subgraph problems
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)
