Any Maximal Planar Graph with Only One Separating Triangle is Hamiltonian.

Published in: J. Comb. Optim. (2003)

Keyphrases

planar graphs
special case
bipartite graph
approximate inference
social networks
weighted graph
partition function
minimum weight
least squares
closed form
probabilistic inference