Skip to main content
SpringerLink
Log in

Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem Difficult

  • Conference paper
Theory and Applications of Models of Computation (TAMC 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6108))

Abstract

We study the computational complexity of the hamiltonian cycle problem in the class of graphs of vertex degree at most 3. Our goal is to distinguish boundary properties of graphs that make the problem difficult (NP-complete) in this domain. In the present paper, we discover the first boundary class of graphs for the hamiltonian cycle problem in subcubic graphs.

Research supported by the Centre for Discrete Mathematics and Its Applications (DIMAP), University of Warwick.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alekseev, V.E.: On easy and hard hereditary classes of graphs with respect to the independent set problem. Discrete Applied Mathematics 132, 17–26 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  2. Alekseev, V.E., Korobitsyn, D.V., Lozin, V.V.: Boundary classes of graphs for the dominating set problem. Discrete Mathematics 285, 1–6 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  3. Alekseev, V.E., Boliac, R., Korobitsyn, D.V., Lozin, V.V.: NP-hard graph problems and boundary classes of graphs. Theoretical Computer Science 389, 219–236 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  4. Arkin, E.M., Mitchell, J.S.B., Polishchuk, V.: Two New Classes of hamiltonian Graphs (Extended Abstract). Electronic Notes in Discrete Mathematics 29, 565–569 (2007)

    Article  Google Scholar 

  5. Chudnovsky, M., Robertson, N., Seymour, P.D., Thomas, R.: The strong perfect graph theorem. Ann. Math. 164, 51–229 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  6. Itai, A., Papadimitriou, C.H., Szwarcfiter, J.L.: Hamilton paths in grid graphs. SIAM J. Computing 11, 676–686 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  7. Lozin, V.V.: Boundary classes of planar graphs. Combinatorics. Probability and Computing 17, 287–295 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  8. Plesńik, J.: The NP-completeness of the Hamiltonial cycle problem in planar digraphs with degree bound two. Information Processing Letters 8, 199–201 (1979)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DIMAP, University of Warwick, Coventry, CV4 7AL, UK

    Nicholas Korpelainen, Vadim V. Lozin & Alexander Tiskin

  2. Mathematics Institute, University of Warwick, Coventry, CV4 7AL, UK

    Nicholas Korpelainen & Vadim V. Lozin

  3. Department of Computer Science, University of Warwick, Coventry, CV4 7AL, UK

    Alexander Tiskin

Authors
  1. Nicholas Korpelainen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vadim V. Lozin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alexander Tiskin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Charles University, Malostranske nam 25, 11800, Praha 1, Czech Republic

    Jan Kratochvíl , Jiří Fiala  & Petr Kolman ,  & 

  2. State Key Lab. of Computer Science, Institute of Software,, Chinese Academy of Sciences, 100190, Beijing, P.R. China

    Angsheng Li

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Korpelainen, N., Lozin, V.V., Tiskin, A. (2010). Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem Difficult. In: Kratochvíl, J., Li, A., Fiala, J., Kolman, P. (eds) Theory and Applications of Models of Computation. TAMC 2010. Lecture Notes in Computer Science, vol 6108. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13562-0_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13562-0_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13561-3

  • Online ISBN: 978-3-642-13562-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation