Graphs of degree 4 are 5-edge-choosable

DOI<250::AID-JGT5>3.0.CO;2-R 10.1002/(SICI)1097-0118(199911)32:3<250::AID-JGT5>3.0.CO;2-RzbMath0934.05052OpenAlexW4247370267MaRDI QIDQ4718735

Bojan Mohar, Riste Škrekovski, Martin Juvan

Publication date: 9 April 2000

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199911)32:3<250::aid-jgt5>3.0.co;2-r

zbMATH Keywords

list coloringlist assignment\(k\)-edge-choosable\(L\)-edge-colorable

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (20)

The edge-face choosability of plane graphs ⋮ Extension from precoloured sets of edges ⋮ Planar graphs with $\Delta\geq 8$ are ($\Delta+1$)-edge-choosable ⋮ The list edge coloring and list total coloring of planar graphs with maximum degree at least 7 ⋮ List-edge-coloring of planar graphs without 6-cycles with three chords ⋮ List edge coloring of planar graphs without 6-cycles with two chords ⋮ An introduction to the discharging method via graph coloring ⋮ Entire coloring of graphs embedded in a surface of nonnegative characteristic ⋮ List edge and list total coloring of 1-planar graphs ⋮ A note on edge-choosability of planar graphs without intersecting 4-cycles ⋮ Edge-choosability of planar graphs without non-induced 5-cycles ⋮ Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof ⋮ Structural properties and edge choosability of planar graphs without 4-cycles ⋮ Edge-choosability of planar graphs without adjacent triangles or without 7-cycles ⋮ Edge choosability of planar graphs without 5-cycles with a chord ⋮ The edge-face coloring of graphs embedded in a surface of characteristic zero ⋮ Edge choosability of planar graphs without small cycles ⋮ List edge coloring of planar graphs without non-induced 6-cycles ⋮ Choosability and edge choosability of planar graphs without five cycles ⋮ Some colouring problems for Paley graphs

This page was built for publication: Graphs of degree 4 are 5-edge-choosable