Login / Signup

Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$-choosable.

Marthe BonamyThéo PierronÉric Sopena
Published in: J. Graph Theory (2023)
Keyphrases
  • planar graphs
  • np hard
  • upper bound
  • least squares
  • lower bound
  • probabilistic model
  • social network analysis