|
gptkbp:instanceOf
|
graph
|
|
gptkbp:application
|
gptkb:traveling_salesman_problem
bioinformatics
circuit design
|
|
gptkbp:category
|
graph
|
|
gptkbp:characterization
|
no simple necessary and sufficient condition is known
|
|
gptkbp:contrastsWith
|
gptkb:Eulerian_graph
|
|
gptkbp:definedIn
|
a graph that contains a Hamiltonian cycle
|
|
gptkbp:example
|
gptkb:Petersen_graph
gptkb:dodecahedron_graph
graph
cycle graph
star graph
|
|
gptkbp:generalizes
|
gptkb:Hamiltonian_path
|
|
gptkbp:hasSubfield
|
gptkb:Hamiltonian-connected_graph
gptkb:Hamiltonian-decomposable_graph
|
|
gptkbp:namedAfter
|
gptkb:William_Rowan_Hamilton
|
|
gptkbp:NP-completeProblem
|
gptkb:Hamiltonian_cycle_problem
|
|
gptkbp:property
|
contains a cycle that visits every vertex exactly once
|
|
gptkbp:relatedTo
|
gptkb:Hamiltonian_cycle
gptkb:Hamiltonian_path
gptkb:Hamiltonian_path_problem
finding Hamiltonian cycles
|
|
gptkbp:studiedBy
|
gptkb:William_Rowan_Hamilton
|
|
gptkbp:studiedIn
|
discrete mathematics
theoretical computer science
|
|
gptkbp:sufficientCondition
|
gptkb:Dirac's_theorem
gptkb:Ore's_theorem
|
|
gptkbp:bfsParent
|
gptkb:William_Rowan_Hamilton
|
|
gptkbp:bfsLayer
|
4
|