Hamiltonian Graphs
A Hamiltonian Graph is a graph that contains a Hamiltonian cycle, defined as a cycle passing through each vertex exactly once, forming a closed loop that visits all vertices without repetition.
834
Publications
31.8K
Citations
1.1K
Authors
579
Institutions
Publications per year
2017–2026
50
Parents
834
How to generate and exchange secrets
Andrew Chi-Chih Yao · 1986 · 3.7K citations
Öystein Ore · American Mathematical Monthly · 1960 · 750 citations
Choice Reviews Online · 2005 · 657 citations
Tough graphs and hamiltonian circuits
Vašek Chvátal · Discrete Mathematics · 1973 · 617 citations
Quantum graphs: I. Some basic structures
Peter Kuchment · Waves in Random Media · 2004 · 612 citations
1–5 of 834
1.1K
18
h-index
15
h-index
15
h-index
14
h-index
13
h-index
1–5 of 1.1K
579

University of Waterloo
Waterloo, Canada
17 h-index
27 publications
1.1K citations
Carnegie Mellon University
Pittsburgh, United States
17 h-index
30 publications
1K citations
Emory University
Atlanta, United States
16 h-index
29 publications
966 citations
Université Paris-Sud
Orsay, France
16 h-index
43 publications
1.4K citations
University of Memphis
Memphis, United States
16 h-index
39 publications
1.1K citations
University of West Bohemia in Pilsen
Pilsen, Czechia
15 h-index
43 publications
878 citations

University of Twente
Enschede, The Netherlands
15 h-index
36 publications
1K citations
Université Paris Cité
Paris, France
14 h-index
24 publications
528 citations
1–8 of 579
123 publications · 3.9K citations
32
h-index
124 publications · 4K citations
31
h-index
67 publications · 2.7K citations
31
h-index
27 publications · 1.1K citations
17
h-index
23 publications · 629 citations
17
h-index
1–5