# Is there a monograph or review of Hamiltonian cycles of graphs (or long cycles of graphs)？

In graph theory, a Hamiltonian cycle is a cycle that visits each vertex exactly once. Hamiltonian cycle has a long history, and I have followed some articles.

We can find plenty of examples of Hamiltonian cycles by using google scholar.

• S. Špacapan, A counterexample to prism-hamiltonicity of 3-connected planar graphs[J]. Journal of Combinatorial Theory, Series B, 2021, 146: 364-371.
• Fabrici I, Harant J, Madaras T, et al. Long cycles and spanning subgraphs of locally maximal 1‐planar graphs[J]. Journal of Graph Theory, 2020, 95(1): 125-137.
• Fabrici I, Madaras T, Timková M, et al. Non-hamiltonian graphs in which every edge-contracted subgraph is hamiltonian[J]. Applied Mathematics and Computation, 2021, 392: 125714.
• Georges J P. Non-Hamiltonian bicubic graphs[J]. Journal of Combinatorial Theory, Series B, 1989, 46(1): 121-124. ...

But what I want to ask is：

• Is there a monograph (or review) of Hamiltonian cycles of graphs (or long cycles of graphs)？

I've been looking for a long time, but I haven't seen some in-depth, systematic monographs. I know that there are monographs on graph coloring, matching, dominating set, crossing number, etc., respectively. There are even several books on some subjects, such as graph coloring or dominating set.

• I have not seen such a monograph either. You can ask these authors if there is a monograph on Hamiltonian cycles. 1) Gould, R. Advances on the Hamiltonian Problem – A Survey. Graphs and Combinatorics 19, 7–52 (2003); 2) Rahman, M. S., & Kaykobad, M. (2005). On Hamiltonian cycles and Hamiltonian paths. Information Processing Letters, 94(1), 37–41. doi:10.1016/j.ipl.2004.12.002 Nov 15, 2022 at 10:56
• Ok, thanks. I will try to contact the authors by emails. These reviews are also great. I also just found a review of Hamiltonian problems on surfaces "K. Ozeki, Hamiltonicity of Graphs on Surfaces in Terms of Toughness and Scattering Number–A Survey[C]//Japanese Conference on Discrete and Computational Geometry, Graphs, and Games. Springer, Cham, 2018: 74-95.". To my surprise, I haven't seen a systematic monograph so far. I don't know what the difficulty is compared to other topics like coloring. Nov 15, 2022 at 11:27