Planar graphs with 8 are (+1)-edge-choosable
From MaRDI portal
Publication:2947439
Recommendations
- Planar graphs with maximum degree D at least 8 are (D+1)-edge-choosable
- Minimum choosability of planar graphs
- Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable
- Structural properties and edge choosability of planar graphs without 6-cycles
- The list edge coloring and list total coloring of planar graphs with maximum degree at least 7
Cites work
- scientific article; zbMATH DE number 3563170 (Why is no real title available?)
- scientific article; zbMATH DE number 821271 (Why is no real title available?)
- scientific article; zbMATH DE number 3273761 (Why is no real title available?)
- Choosability and edge choosability of planar graphs without five cycles
- Colorings of plane graphs: a survey
- Edge choosability of planar graphs without small cycles
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs
- Graphs of degree 4 are 5-edge-choosable
- List edge and list total colourings of multigraphs
- Planar graphs of maximum degree seven are Class I
- Planar graphs with maximum degree D at least 8 are (D+1)-edge-choosable
- 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
Cited in
(15)- Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable
- A note on the minimum number of choosability of planar graphs
- Maximum average degree of list-edge-critical graphs and Vizing's conjecture
- scientific article; zbMATH DE number 2188336 (Why is no real title available?)
- List edge coloring of planar graphs without 6-cycles with two chords
- Extension from precoloured sets of edges
- List-edge-colouring planar graphs with precoloured edges
- Kempe equivalent list edge-colorings of planar graphs
- Edge DP-coloring in planar graphs
- Signed planar graphs with \(\Delta \geq 8\) are \(\Delta\)-edge-colorable
- The list edge coloring and list total coloring of planar graphs with maximum degree at least 7
- Sufficient conditions make graphs edge DP-\(\varDelta\)-colorable
- Planar graphs with maximum degree D at least 8 are (D+1)-edge-choosable
- An introduction to the discharging method via graph coloring
- List-edge-coloring of planar graphs without 6-cycles with three chords
This page was built for publication: Planar graphs with \(\Delta\geq 8\) are (\(\Delta+1\))-edge-choosable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2947439)
