Hamiltonian Paths and Cycles in Planar Graphs
We examine the problem of counting the number of Hamiltonian paths and Hamiltonian cycles in outerplanar graphs and planar graphs, respectively. We give an O(nα n ) upper bound and an Ω(α n ) lower bound on the maximum number of Hamiltonian paths in an outerplanar graph with n vertices, where α ≈ 1.46557 is the unique real root of α 3 = α 2 + 1. For any positive integer n ≥ 6, we define an outerplanar graph G, called a ZigZag outerplanar graph, such that the number of Hamiltonian paths starting at a single vertex in G is the maximum over all possible outerplanar graphs with n vertices. Finally, we prove a 2.2134 n upper bound on the number of Hamiltonian cycles in planar graphs, which improves the previously best known upper bound 2.3404 n .
Unable to display preview. Download preview PDF.
- 7.Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company (1979)Google Scholar