On list edge-colorings of subcubic graphs
From MaRDI portal
Publication:1584301
DOI10.1016/S0012-365X(97)00230-6zbMATH Open0957.05044MaRDI QIDQ1584301FDOQ1584301
Authors: Martin Juvan, Riste Škrekovski, Bojan Mohar
Publication date: 2 November 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Cites Work
Cited In (13)
- On strong list edge coloring of subcubic graphs
- Strong list edge coloring of subcubic graphs
- Note on list star edge‐coloring of subcubic graphs
- Extension from precoloured sets of edges
- COLORING ALGORITHMS ON SUBCUBIC GRAPHS
- Classes of 3-regular graphs that are (7, 2)-edge-choosable
- Bridgeless cubic graphs are (7,2)-edge-choosable
- On parsimonious edge-colouring of graphs with maximum degree three
- Approximating the maximum 2- and 3-edge-colorable subgraph problems
- List star edge-coloring of subcubic graphs
- Linear colorings of subcubic graphs
- List-Coloring Squares of Sparse 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)