On 3-choosable planar graphs of girth at least 4.

Published in: Discret. Math. (2009)

Keyphrases

planar graphs
max cut
minimum weight
approximate inference
weighted graph
bayesian networks
graphical models
bipartite graph