Skip to main content
SpringerLink
Log in

Placing Specified Vertices at Precise Locations on a Hamiltonian Cycle

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

Sharp minimum degree and degree sum conditions are proven for the existence of a Hamiltonian cycle passing through specified vertices with prescribed distances between them in large graphs.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Chartrand, G., Lesniak, L., Zhang, P.: Graphs & Digraphs, 5th edn. CRC Press, Boca Raton (2011)

    MATH  Google Scholar 

  2. Coll, V., Halperin, A., Magnant, C.: Graph linkage with prescribed lengths (submitted)

  3. Coll, V., Halperin, A., Magnant, C., Salehi Nowbandegani, P.: Enomoto and Ota’s conjecture holds for large graphs (manuscript)

  4. Diestel, R.: Graph theory. In: Graduate Texts in Mathematics, vol. 173, 4th edn. Springer, Heidelberg (2010)

  5. Enomoto, H.: Personal communication

  6. Faudree, R.J., Gould, R.J.: Precise location of vertices on Hamiltonian cycles. Discrete Math. 313(23), 2772–2777 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  7. Faudree, R.J., Gould, R.J., Jacobson, M.S., Magnant, C.: Distributing vertices on Hamiltonian cycles. J. Graph Theory 69(1), 28–45 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  8. Faudree, R.J., Lehel, J., Yoshimoto, K.: Note on locating pairs of vertices on Hamiltonian cycles. Graphs Combin. 30(4), 887–894 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  9. Faudree, R.J., Li, H.: Locating pairs of vertices on Hamiltonian cycles. Discrete Math. 312(17), 2700–2706 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  10. Kaneko, A., Yoshimoto, K.: On a Hamiltonian cycle in which specified vertices are uniformly distributed. J. Combin. Theory Ser. B 81(1), 100–109 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  11. Komlós, J., Sárközy, G.N., Szemerédi, E.: Blow-up lemma. Combinatorica 17(1), 109–123 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  12. Kühn, D., Osthus, D., Treglown, A.: An Ore-type theorem for perfect packings in graphs. SIAM J. Discrete Math. 23(3), 1335–1355 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  13. Magnant, C., Salehi Nowbandegani, P.: Note on lengths of cycles containing a specified edge (manuscript)

  14. Ore, O.: Note on Hamilton circuits. Am. Math. Mon. 67, 55 (1960)

    Article  MathSciNet  MATH  Google Scholar 

  15. Sárközy, G.N., Selkow, S.: Distributing vertices along a Hamiltonian cycle in Dirac graphs. Discrete Math. 308(23), 5757–5770 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  16. Szemerédi, E.: Regular partitions of graphs. In: Problèmes combinatoires et théorie des graphes (Colloquium International CNRS, University of Orsay, Orsay, 1976), vol. 260. Colloquium International, CNRS, pp. 399–401. CNRS, Paris (1978)

  17. Williamson, J.E.: Panconnected graphs. II. Period. Math. Hung. 8(2), 105–116 (1977)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Emory University, Atlanta, GA, USA

    Ronald J. Gould

  2. Department of Mathematical Sciences, Georgia Southern University, Statesboro, GA, USA

    Colton Magnant

  3. Department of Mathematics, Vanderbilt University, Nashville, TN, USA

    Pouria Salehi Nowbandegani

Authors
  1. Ronald J. Gould
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Colton Magnant
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pouria Salehi Nowbandegani
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Colton Magnant.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gould, R.J., Magnant, C. & Salehi Nowbandegani, P. Placing Specified Vertices at Precise Locations on a Hamiltonian Cycle. Graphs and Combinatorics 33, 369–385 (2017). https://doi.org/10.1007/s00373-017-1762-y

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-017-1762-y

Keywords

Search

Navigation