## References

- [1] M. B. Dillencourt, Polyhedra of Small Order and Their Hamiltonian Properties, J. Combin. Theory, Ser. B 66 (1996), 87–122.
- [2] I. Fabrici, J. Harant, S. Jendroľ, On longest cycles in essentially -connected planar graphs, Discuss. Math. Graph Theory 36 (2016), 565–575.
- [3] B. Grünbaum, J. Malkevitch, Pairs of edge-disjoint Hamilton circuits, Aequationes Math. 14 (1976), 191–196.
- [4] B. Jackson, N. C. Wormald, Longest cycles in -connected planar graphs, J. Combin. Theory, Ser. B 54 (1992), 291–321.
- [5] D. P. Sanders, On paths in planar graphs, J. Graph Theory 24:4 (1997), 341–345.
- [6] A. Schmid, J. M. Schmidt, Computing Tutte Paths, arXiv-preprint (https://arxiv.org/abs/1707.05994), July 2017.
- [7] C.-Q. Zhang, Longest cycles and their chords, J. Graph Theory 11 (1987), 521–529.

Comments

There are no comments yet.