Hamiltonian Circuits
Hamiltonian Circuits is a cycle in a graph that visits each vertex exactly once and returns to the starting vertex.
199
Publications
16K
Citations
357
Authors
228
Institutions
Publications per year
2017–2026
23
Parents
199
On maximal paths and circuits of graphs
P. Erdös · Acta Mathematica Academiae Scientiarum Hungaricae · 1959 · 903 citations
Planar Formulae and Their Uses
David Lichtenstein · SIAM Journal on Computing · 1982 · 754 citations
Öystein Ore · American Mathematical Monthly · 1960 · 750 citations
Quantum Entanglement Growth under Random Unitary Dynamics
Physical Review X · 2017 · 646 citations · Full text
1–5 of 199
357
5
h-index
5
h-index
4
h-index
3
h-index
3
h-index
1–5 of 357
228

University of Waterloo
Waterloo, Canada
6 h-index
12 publications
497 citations

National Yang Ming Chiao Tung University
Hsinchu, Taiwan
5 h-index
11 publications
398 citations
National United University
Miaoli, Taiwan
5 h-index
5 publications
170 citations

Centre National de la Recherche Scientifique
Paris, France
4 h-index
7 publications
277 citations
Columbia University
New York, United States
3 h-index
3 publications
660 citations

Eötvös Loránd University
Budapest, Hungary
3 h-index
4 publications
1.4K citations
Google (United States)
Mountain View, United States
3 h-index
13 publications
3K citations
Massachusetts Institute of Technology
Cambridge, United States
3 h-index
8 publications
4.2K citations
1–8 of 228
20 publications · 2.5K citations
16
h-index
15 publications · 679 citations
13
h-index
15 publications · 535 citations
12
h-index
10 publications · 252 citations
10
h-index
9 publications · 289 citations
9
h-index
1–5