Planar graphs without 4- and 6-cycles are (3,4)-colorable.

Kittikorn Nakprasit Pongpat Sittitrai Wannapol Pimpasalee

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

Keyphrases

planar graphs
approximate inference
minimum weight
upper bound
pairwise
random walk
belief propagation