Login / Signup

An upper bound on the length of a Hamiltonian walk of a maximal planar graph.

Takao AsanoTakao NishizekiTakahiro Watanabe
Published in: J. Graph Theory (1980)
Keyphrases
  • upper bound
  • planar graphs
  • lower bound
  • partition function
  • worst case
  • branch and bound algorithm
  • branch and bound
  • random walk
  • lower and upper bounds
  • minimum weight
  • objective function
  • higher order