Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable.

Pongpat Sittitrai Kittikorn Nakprasit

Published in: CoRR (2018)

Keyphrases

planar graphs
pairwise
belief propagation
semi supervised
approximate inference
minimum weight
markov random field
graphical models
similarity measure
probabilistic model
higher order
message passing
partition function
objective function
conditional random fields
bipartite graph