Login / Signup

Planar graphs without 4-cycles are acyclically 6-choosable.

Weifan WangMin Chen
Published in: J. Graph Theory (2009)
Keyphrases
  • planar graphs
  • approximate inference
  • minimum weight
  • bipartite graph
  • random walk
  • parameter estimation
  • belief propagation