Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof

DOI10.1016/j.disc.2010.07.004zbMath1208.05016MaRDI QIDQ710613

Frédéric Havet, Nathann Cohen

Publication date: 19 October 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2010.07.004

zbMATH Keywords

edge-colouring; planar graph; list-colouring; list colouring conjecture

Mathematics Subject Classification ID

05C10: Planar graphs; geometric and topological aspects of graph theory

05C15: Coloring of graphs and hypergraphs

Related Items

Maximum average degree of list-edge-critical graphs and Vizing's conjecture, Group edge choosability of planar graphs without adjacent short cycles, An introduction to the discharging method via graph coloring, List-edge-colouring planar graphs with precoloured edges, Extension from precoloured sets of edges, Planar graphs with $\Delta\geq 8$ are ($\Delta+1$)-edge-choosable

Cites Work

• Unnamed Item
• List-colourings of graphs
• Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs
• Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors
• List edge and list total colourings of multigraphs
• Planar graphs of maximum degree seven are Class I
• The list chromatic index of a bipartite multigraph
• New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
• Near-optimal list colorings
• Graphs of degree 4 are 5-edge-choosable
• Short Proof of Galvin's Theorem on the List-chromatic Index of a Bipartite Multigraph
• A Generalization of Kotzig’s Theorem and Its Application