Hamiltonian Cycles is a graph-theoretic construct that refers to a cycle within a network that visits each node exactly once before returning to the starting node, distinguishing it from other types of cycles by its completeness and non-repetition of vertices in the traversal.
910
Publications
31.7K
Citations
1.2K
Authors
611
Institutions
Publications per year
2017–2026
56
Variants
Hamiltonian Cycle
Parents
Publications
910
Tough graphs and hamiltonian circuits
Vašek Chvátal · Discrete Mathematics · 1973 · 617 citations
Cycles of even length in graphs
J. A. Bondy, Miklós Simonovits · Journal of Combinatorial Theory Series B · 1974 · 412 citations
Controlling discrete quantum walks: coins and initial states
Ben Tregenna, W. Flanagan, Rik Maile et al. · New Journal of Physics · 2003 · 274 citations · Full text
1–5 of 910
Authors
1.2K
- AF
22
h-index
- CT
16
h-index
- MK
14
h-index
- BJ
14
h-index
- DO
13
h-index
1–5 of 1.2K
Institutions
611
University of Waterloo
Waterloo, Canada
19 h-index
30 publications
1.4K citations
Carnegie Mellon University
Pittsburgh, United States
19 h-index
35 publications
1.1K citations
Tel Aviv University
Tel Aviv, Israel
18 h-index
29 publications
989 citations
Emory University
Atlanta, United States
15 h-index
23 publications
948 citations
Centre National de la Recherche Scientifique
Paris, France
15 h-index
28 publications
1.1K citations
Simon Fraser University
Burnaby, Canada
13 h-index
16 publications
525 citations
University of Memphis
Memphis, United States
13 h-index
32 publications
932 citations
ETH Zurich
Zurich, Switzerland
13 h-index
26 publications
697 citations
1–8 of 611
Venues
- Discrete Mathematics
141 publications · 5.1K citations
35
h-index
- Journal of Combinatorial Theory Series B
87 publications · 4.1K citations
34
h-index
- Journal of Graph Theory
93 publications · 3.2K citations
30
h-index
- Random Structures and Algorithms
30 publications · 919 citations
19
h-index
- Discrete Applied Mathematics
32 publications · 885 citations
17
h-index
1–5