Every planar graph with Δ≥8 is totally (Δ+2)-choosable.

Marthe Bonamy Théo Pierron Éric Sopena

Published in: CoRR (2019)

Keyphrases

planar graphs
approximate inference
weighted graph
bayesian networks
parameter estimation
boundary points
minimum weight