Every planar graph of maximum degree 8 is totally 10-choosable - Archive ouverte HAL
Communication Dans Un Congrès Année : 2018

Every planar graph of maximum degree 8 is totally 10-choosable

Theo Pierron
Fichier non déposé

Dates et versions

hal-02264675 , version 1 (07-08-2019)

Identifiants

  • HAL Id : hal-02264675 , version 1

Citer

Marthe Bonamy, Theo Pierron, Eric Sopena. Every planar graph of maximum degree 8 is totally 10-choosable. 10th International Colloquium on Graph Theory and combinatorics, ICGT'18, 2018, Lyon, France. ⟨hal-02264675⟩

Collections

CNRS TDS-MACS
12 Consultations
0 Téléchargements

Partager

More