Every planar graph is 1-defective (9, 2)-paintable.

Ming Han Hal A. Kierstead Xuding Zhu

Published in: Discret. Appl. Math. (2021)

Keyphrases

planar graphs
minimum weight
graphical models
belief propagation
approximate inference
bayesian networks
dynamic programming