Planar graphs with 8 are (+1)-edge-choosable
From MaRDI portal
Publication:2947439
DOI10.1137/130927449zbMATH Open1321.05061OpenAlexW1440732937MaRDI QIDQ2947439FDOQ2947439
Authors: Marthe Bonamy 
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
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
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- List edge and list total colourings of multigraphs
- Colorings of plane graphs: a survey
- Title not available (Why is that?)
- Title not available (Why is that?)
- Planar graphs of maximum degree seven are Class I
- Title not available (Why is that?)
- Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof
- Choosability and edge choosability of planar graphs without five cycles
- Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs
- Edge choosability of planar graphs without small cycles
- Graphs of degree 4 are 5-edge-choosable
- Structural properties and edge choosability of planar graphs without 4-cycles
- Planar graphs with maximum degree D at least 8 are (D+1)-edge-choosable
Cited In (15)
- Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable
- Title not available (Why is that?)
- Maximum average degree of list-edge-critical graphs and Vizing's conjecture
- List edge coloring of planar graphs without 6-cycles with two chords
- A note on the minimum number of choosability of planar graphs
- 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)
