Abstract
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.2134n upper bound on the number of Hamiltonian cycles in planar graphs, which improves the previously best known upper bound 2.3404n.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bax, E.T.: Inclusion and exclusion algorithm for the Hamiltonian path problem. Information Processing Letters 47(4), 203–207 (1993)
Buchin, K., Knauer, C., Kriegel, K., Schulz, A., Seidel, R.: On the Number of Cycles in Planar Graphs. In: Lin, G. (ed.) COCOON 2007. LNCS, vol. 4598, pp. 97–107. Springer, Heidelberg (2007)
Collins, K.L., Krompart, L.B.: The number of Hamiltonian paths in a rectangular grid. Discrete Mathematics 169(1-3), 29–38 (1997)
Curran, S.J., Gallian, J.A.: Hamiltonian cycles and paths in Cayley graphs and digraphs - A survey. Discrete Mathematics 156(1-3), 1–18 (1996)
de Mier, A., Noy, M.: On the maximum number of cycles in outerplanar and series-parallel graphs. Electronic Notes in Discrete Mathematics 34, 489–493 (2009)
Eppstein, D.: The traveling salesman problem for cubic graphs. Journal of Graph Algorithms and Applications 11(1), 61–81 (2007)
Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company (1979)
Gebauer, H.: Finding and enumerating Hamilton cycles in 4-regular graphs. Theoretical Computer Science 412(35), 4579–4591 (2011)
Pichler, R., Rümmele, S., Woltran, S.: Counting and Enumeration Problems with Bounded Treewidth. In: Clarke, E.M., Voronkov, A. (eds.) LPAR-16 2010. LNCS (LNAI), vol. 6355, pp. 387–404. Springer, Heidelberg (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Biswas, S., Durocher, S., Mondal, D., Nishat, R.I. (2012). Hamiltonian Paths and Cycles in Planar Graphs. In: Lin, G. (eds) Combinatorial Optimization and Applications. COCOA 2012. Lecture Notes in Computer Science, vol 7402. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31770-5_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-31770-5_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31769-9
Online ISBN: 978-3-642-31770-5
eBook Packages: Computer ScienceComputer Science (R0)