Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
Graph Theory Concept
|
| gptkbp:application |
gptkb:Traveling_Salesman_Problem
|
| gptkbp:contrastsWith |
Eulerian Graph
|
| gptkbp:definedIn |
A graph that contains a Hamiltonian cycle
|
| https://www.w3.org/2000/01/rdf-schema#label |
Hamiltonian Graph
|
| gptkbp:namedAfter |
gptkb:William_Rowan_Hamilton
|
| gptkbp:property |
A Hamiltonian graph has a spanning cycle
A Hamiltonian graph is always 2-connected A cubic graph may or may not be Hamiltonian A planar graph may or may not be Hamiltonian Every complete graph is Hamiltonian Every cycle graph is Hamiltonian May be directed or undirected Not all bipartite graphs are Hamiltonian Chvátal's theorem gives a sufficient condition for Hamiltonicity Dirac's theorem gives a sufficient condition for Hamiltonicity NP-complete to determine if a general graph is Hamiltonian Ore's theorem gives a sufficient condition for Hamiltonicity |
| gptkbp:relatedTo |
gptkb:Hamiltonian_Cycle
gptkb:Hamiltonian_Path |
| gptkbp:studiedIn |
gptkb:Graph_Theory
|
| gptkbp:bfsParent |
gptkb:Non-Hamiltonian_Graph
|
| gptkbp:bfsLayer |
6
|