Every planar graph with girth at least 5 is (1, 9)-colorable.

Xiangwen Li Jie Liu Jian-Bo Lv

Published in: Discret. Math. (2022)

Keyphrases

planar graphs
minimum weight
approximate inference
undirected graph
belief propagation
image segmentation
bayesian networks
special case
higher order
data points
latent variables
bipartite graph
weighted graph