The square of every subcubic planar graph of girth at least 6 is 7-choosable.

Seog-Jin Kim Xiaopan Lian

Published in: Discret. Math. (2024)

Keyphrases

planar graphs
approximate inference
lower bound
minimum weight
image segmentation
pairwise
np hard
weighted graph