Planar graphs with maximum degree Δ≥9 are (Δ+1)-edge-choosable—A short proof - Archive ouverte HAL Access content directly
Journal Articles Contributions to Discrete Mathematics Year : 2010

Planar graphs with maximum degree Δ≥9 are (Δ+1)-edge-choosable—A short proof

Abstract

We give a short proof of the following theorem due to Borodin (1990). Every planar graph G with maximum degree at least 9 is (Δ(G)+1)-edge-choosable.

Dates and versions

hal-01338378 , version 1 (28-06-2016)

Identifiers

Cite

Nathann Cohen, Frédéric Havet. Planar graphs with maximum degree Δ≥9 are (Δ+1)-edge-choosable—A short proof. Contributions to Discrete Mathematics, 2010, 310 (21), ⟨10.1016/j.disc.2010.07.004⟩. ⟨hal-01338378⟩
216 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More