Five-Connected Toroidal Graphs Are Hamiltonian

@article{Thomas1997FiveConnectedTG,
  title={Five-Connected Toroidal Graphs Are Hamiltonian},
  author={Robin Thomas and Xingxing Yu},
  journal={J. Comb. Theory, Ser. B},
  year={1997},
  volume={69},
  pages={79-96}
}
We prove that every edge in a 5-connected graph embedded in the torus is contained in a Hamilton cycle. Our proof is constructive and implies a polynomial time algorithm for finding a Hamilton cycle. Published in J. Combin. Theory Ser. B 69 (1997), no. 1, 79–96. partially supported by NSF grants DMS-9103480 and DMS-9303761 partially supported by NSF grants DMS-9105173 and DMS-9301909 

References

Publications referenced by this paper.
SHOWING 1-7 OF 7 REFERENCES

Nash–Williams, Unexplored and semi-explored territories in graph theory

  • J A.C.St.
  • New Directions in Graph Theory,
  • 1973
2 Excerpts

Tutte, A theorem on planar graphs

  • W T.
  • Trans. Amer. Math. Soc
  • 1956
1 Excerpt

A theorem on graphs

  • H. Whitney
  • Ann. of Math
  • 1931
1 Excerpt

Similar Papers

Loading similar papers…