Planar graphs with $\Delta\geq 8$ are ($\Delta+1$)-edge-choosable
From MaRDI portal
Publication:2947439
DOI10.1137/130927449zbMath1321.05061OpenAlexW1440732937MaRDI QIDQ2947439
Publication date: 23 September 2015
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/130927449
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (9)
Maximum average degree of list-edge-critical graphs and Vizing's conjecture ⋮ Extension from precoloured sets of edges ⋮ Edge DP-coloring in planar graphs ⋮ Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable ⋮ Kempe equivalent list edge-colorings of planar graphs ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- List edge and list total colourings of multigraphs
- Choosability and edge choosability of planar graphs without five cycles
- Edge choosability of planar graphs without small cycles
- Planar graphs of maximum degree seven are Class I
- Colorings of plane graphs: a survey
- Graphs of degree 4 are 5-edge-choosable
- Planar graphs with maximum degree D at least 8 are (D+1)-edge-choosable
This page was built for publication: Planar graphs with $\Delta\geq 8$ are ($\Delta+1$)-edge-choosable
