Skip to main content
SpringerLink
Log in

Criticality of Counterexamples to Toroidal Edge-Hamiltonicity

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

Abstract

A well-known conjecture of Grünbaum and Nash-Williams proposes that \(4\)-connected toroidal graphs are Hamiltonian. The corresponding results for \(4\)-connected planar and projective-planar graphs were proved by Tutte and by Thomas and Yu, respectively, using induction arguments that proved a stronger result, that every edge is on a Hamilton cycle. However, this stronger property does not hold for \(4\)-connected toroidal graphs: Thomassen constructed counterexamples. Thus, the standard inductive approach will not work for the torus. One possible way to modify it is by characterizing the situations where some edge is not on a Hamilton cycle. We provide a contribution in this direction, by showing that the obvious generalizations of Thomassen’s counterexamples are critical in a certain sense.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  1. Altshuler, A.: Hamiltonian circuits in some maps on the torus. Discret. Math. 1, 299–314 (1972)

    Article  MATH  MathSciNet  Google Scholar 

  2. Brunet, R., Richter, R.B.: Hamiltonicity of 5-connected toroidal triangulations. J. Graph Theory 20, 267–286 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  3. Chiba, N., Nishizeki, T.: A theorem on paths in planar graphs. J. Graph Theory 10, 449–450 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  4. Fujisawa, J., Nakamoto, A., Ozeki, K.: Hamiltonian cycles in bipartite toroidal graphs with a partite set of degree four vertices. J. Comb. Theory Ser. B 103, 46–60 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  5. Grünbaum, B.: Polytopes, graphs and complexes. Bull. Am. Math. Soc. 76, 1131–1201 (1970)

    Article  MATH  Google Scholar 

  6. Kawarabayashi, K., Ozeki, K.: \(4\)-connected projective-planar graphs are Hamilton-connected. In: Proceedings of 24th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 378–395. SIAM, Philadelphia, PA (2012)

  7. Kawarabayashi, K., Ozeki, K.: Hamilton cycles in \(4\)-connected troidal [sic] triangulations. Electron. Notes Discret. Math. 38, 493–498 (2011)

    Article  Google Scholar 

  8. Nakamoto, A., Negami, S.: Full-symmetric embeddings of graphs on closed surfaces. Mem. Osaka Kyoiku Univ. Ser. III 49, 1–15 (2000)

    MathSciNet  Google Scholar 

  9. Nakamoto, A., Ozeki, K.: Hamiltonian cycles in bipartite quadrangulations on the torus. J. Graph Theory 69, 143–151 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  10. Nash-Williams, C.St.J.A.:Unexplored and semi-explored territories in graph theory. In: Harary, F. (ed.) New Directions in the Theory of Graphs. Proceedings of Third Ann Arbor Conference, University of Michigan, Ann Arbor, MI, 1971, pp. 149–186. Academic Press. New York (1973)

  11. Thomas, R., Yu, X.: \(4\)-connected projective-planar graphs are hamiltonian. J. Comb. Theory Ser. B 62, 114–132 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  12. Thomas, R., Yu, X.: 5-connected toroidal graphs are hamiltonian. J. Comb. Theory Ser. B 69, 79–96 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  13. Thomas, R., Yu, X., Zang, W.: Hamilton paths in toroidal graphs. J. Comb. Theory Ser. B 94, 214–236 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  14. Thomassen, C.: A theorem on paths in planar graphs. J. Graph Theory 7, 169–176 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  15. Thomassen, C.: Tilings of the torus and the Klein bottle and vertex-transitive graphs on a fixed surface. Trans. Am. Math. Soc. 323, 605–635 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  16. Tutte, W.T.: A theorem on planar graphs. Trans. Am. Math. Soc. 82, 99–116 (1956)

    Article  MATH  MathSciNet  Google Scholar 

  17. Tutte, W.T.: Bridges and hamiltonian circuits in planar graphs. Aequationes Math. 15, 1–33 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  18. Whitney, H.: A theorem on graphs. Ann. Math. 32, 378–390 (1931)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgments

The first author acknowledges support from the U.S. National Security Agency (NSA) under Grant number H98230–09–1–0065. Both authors acknowledge support from the NSA under Grant number H98230–13–1–0233, and from the Simons Foundation under award number 245715.

Author information

Author notes

  1. Emily A. Marshall

    Present address: Department of Mathematics, Louisiana State University, Baton Rouge, LA, 70803, USA

Authors and Affiliations

  1. Department of Mathematics, Vanderbilt University, 1326 Stevenson Center, Nashville, TN, 37240, USA

    M. N. Ellingham & Emily A. Marshall

Authors
  1. M. N. Ellingham
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Emily A. Marshall
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. N. Ellingham.

Additional information

The United States Government is authorized to reproduce and distribute reprints notwithstanding any copyright notation herein.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ellingham, M.N., Marshall, E.A. Criticality of Counterexamples to Toroidal Edge-Hamiltonicity. Graphs and Combinatorics 32, 111–121 (2016). https://doi.org/10.1007/s00373-015-1542-5

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-015-1542-5

Keywords

Search

Navigation