The Hamiltonian Circuit Problem is Polynomial for 4-Connected Planar Graphs.

Dominique Gouyou-Beauchamps

Published in: SIAM J. Comput. (1982)

Keyphrases

planar graphs
connected components
approximate inference
objective function
weighted graph
graph coloring
minimum weight