Planar graphs with girth at least 5 are (3, 4)-colorable.

Ilkyoo Choi Gexin Yu Xia Zhang

Published in: Discret. Math. (2019)

Keyphrases

planar graphs
max cut
minimum weight
belief propagation
approximate inference
least squares
bipartite graph