Planar graphs with maximum degree Δ≥9 are (Δ+1)-edge-choosable—A short proof
Résumé
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.
Nathann Cohen : Connectez-vous pour contacter le contributeur
https://hal.science/hal-01338378
Soumis le : mardi 28 juin 2016-15:01:48
Dernière modification le : jeudi 14 mars 2024-03:11:28