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

Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-02264675
Contributor : Eric Sopena <>
Submitted on : Wednesday, August 7, 2019 - 2:44:50 PM
Last modification on : Thursday, August 8, 2019 - 1:07:17 AM

Identifiers

  • HAL Id : hal-02264675, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

3