Advertisement

Pseudo-hamiltonian graphs

  • Luitpold Babel
  • Gerhard J. Woeginger
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1335)

Abstract

A pseudo-h-hamiltonian cycle in a graph is a closed walk that visits every vertex exactly h times. We present a variety of combinatorial and algorithmic results on pseudo- h-hamiltonian cycles: First, we show that deciding whether a graph is pseudo-h-hamiltonian is NP-complete for any given h ≥ 1. Surprisingly, deciding whether there exists an h ≥ 1 such that the graph is pseudo-h-hamiltonian, can be done in polynomial time. We also present sufficient conditions for pseudo- h-hamiltonicity that are based on stable sets and on toughness. Moreover, we investigate the computational complexity of finding pseudo-h-hamiltonian cycles on special graph classes like bipartite graphs, split graphs, planar graphs, cocomparability graphs; in doing this, we establish a precise separating line between easy and difficult cases of this problem.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms 12 (1991) 308–340Google Scholar
  2. 2.
    Berge, C.: Regularizable graphs I. Discrete Mathematics 23 (1978) 85–89Google Scholar
  3. 3.
    Berge, C.: Regularizable graphs II. Discrete Mathematics 23 (1978) 91–95Google Scholar
  4. 4.
    Bodlaender, H.L.: Some classes of graphs with bounded treewidth. Bulletin off the EATCS 36 (1988) 116–126Google Scholar
  5. 5.
    Chvátal, V.: Tough graphs and hamiltonian circuits. Discrete Mathematics 5 (1973) 215–228Google Scholar
  6. 6.
    Corneil, D.G., Olariu, S., Stewart, L.: Asteroidal triple-free graphs. Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science WG'93, Springer Verlag, LNCS 790, 1994, 211–224Google Scholar
  7. 7.
    Deogun, J.S., Steiner, G.: Polynomial algorithms for hamiltonian cycles in cocomparability graphs. SIAM J. Computing 23 (1994) 520–552Google Scholar
  8. 8.
    Fleischner, H.: The square of every two-connected graph is hamiltonian. J. Combinatorial Theory B 16 (1974) 29–34Google Scholar
  9. 9.
    Garey, M.R., Johnson, D.S.: Computers and intractability, A guide to the theory of NP-completeness. Freeman, San Francisco, 1979Google Scholar
  10. 10.
    Johnson, D.S.: The NP-completeness column: an ongoing guide. J. Algorithms 6 (1985) 434–451Google Scholar
  11. 11.
    Lovász, L., Plummer, M.D.: Matching theory. Annals of Discrete Math. 29, North-Holland, 1986Google Scholar
  12. 12.
    van Leeuwen, J.: Graph algorithms, in: Handbook of Theoretical Computer Science, A: Algorithms and Complexity Theory, 527–631, North Holland, Amsterdam, 1990Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Luitpold Babel
    • 1
  • Gerhard J. Woeginger
    • 2
  1. 1.Institut für MathematikTU MünchenMünchenGermany
  2. 2.Institut für Mathematik BTU GrazGrazAustria

Personalised recommendations