Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
Hamiltonicity
Description:
A graph-theoretic property concerning the existence of a Hamiltonian cycle, a closed path that visits every vertex exactly once.
Primary topic:
Advanced Graph Theory Research (45%)
Related topics:
Advanced Graph Theory Research (45%),
Limits and Structures in Graph Theory (21%),
Finite Group Theory Research (8%),
Graph theory and applications (8%)
OpenAlex ID:
keywords/hamiltonicity
A Textbook of Graph Theory
2000
·
R. Balakrishnan
, K. Ranganathan
·
Universitext
·
662
On a Closure Concept in Claw-Free Graphs
1997
·
Zdeněk Ryjáček
·
Journal of Combinatorial Theory Series B
·
330
PDF
Claw-free graphs — A survey
1997
·
Ralph Faudree
, Evelyne Flandrin
, et al.
·
Discrete Mathematics
·
255
Algorithmic graph theory
1990
·
Choice Reviews Online
·
167
DAG-Width and Parity Games
2006
·
Dietmar Berwanger
, Anuj Dawar
, et al.
·
Lecture notes in computer science
·
153
PDF
Finding Hamiltonian circuits in interval graphs
1985
·
J.Mark Keil
·
Information Processing Letters
·
149
Structure of Fibonacci cubes: a survey
2011
·
Sandi Klavžar
·
Journal of Combinatorial Optimization
·
146
Random regular graphs of high degree
2001
·
Michael Krivelevich
, Benny Sudakov
, et al.
·
Random Structures and Algorithms
·
128
Hamiltonian circuits in Cayley graphs
1983
·
Dragan Marušič
·
Discrete Mathematics
·
127
PDF
Many-to-many disjoint path covers in hypercube-like interconnection networks with faulty elements
2006
·
Jung-Heum Park
, Hee-Chul Kim
, et al.
·
IEEE Transactions on Parallel and Distributed Systems
·
124
The dag-width of directed graphs
2012
·
Dietmar Berwanger
, Anuj Dawar
, et al.
·
Journal of Combinatorial Theory Series B
·
116
PDF
Fast Hamiltonicity Checking Via Bases of Perfect Matchings
2018
·
Marek Cygan
, Stefan Kratsch
, et al.
·
Journal of the ACM
·
101
Loose Hamilton cycles in hypergraphs
2011
·
Peter Keevash
, Daniela Kühn
, et al.
·
Discrete Mathematics
·
86
PDF
Signless Laplacian spectral radius and Hamiltonicity
2009
·
Bo Zhou
·
Linear Algebra and its Applications
·
83
PDF
Independence trees and Hamilton cycles
1998
·
Hajo Broersma
, Hilde Tuinstra
·
Journal of Graph Theory
·
81
PDF
Toughness, hamiltonicity and split graphs
1996
·
Dieter Kratsch
, Jenő Lehel
, et al.
·
Discrete Mathematics
·
81
PDF
Untitled
2007
·
Journal of Graph Theory
·
79
Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs
1998
·
David C. Fisher
, Patricia A. McKenna
, et al.
·
Discrete Applied Mathematics
·
79
PDF
On two Hamilton cycle problems in random graphs
2008
·
Alan Frieze
, Michael Krivelevich
·
Israel Journal of Mathematics
·
76
Hamiltonian properties of triangular grid graphs
2008
·
Valery S. Gordon
, Yury L. Orlovich
, et al.
·
Discrete Mathematics
·
72
PDF
Generalizations of Dirac’s theorem in Hamiltonian graph theory—A survey
2012
·
Hao Li
·
Discrete Mathematics
·
71
PDF
Fast hamiltonicity checking via bases of perfect matchings
2013
·
Marek Cygan
, Stefan Kratsch
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
70
Cayley digraphs of prime-power order are hamiltonian
1986
·
Dave Witte
·
Journal of Combinatorial Theory Series B
·
70
PDF
Almost all Regular Graphs are Hamiltonian
1983
·
Béla Bollobás
·
European Journal of Combinatorics
·
70
PDF
On the Fault-Tolerant Hamiltonicity of Faulty Crossed Cubes
2002
·
Wen‐Tzeng Huang
, Yen-Chu Chuang
, et al.
·
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences
·
67
Show more works
View as search
Works count:
982
Citation count:
10,130
Year
Topic
Type