An efficient condition for a graph to be Hamiltonian (Q2383542)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An efficient condition for a graph to be Hamiltonian |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient condition for a graph to be Hamiltonian |
scientific article |
Statements
An efficient condition for a graph to be Hamiltonian (English)
0 references
19 September 2007
0 references
distance
0 references
Hamiltonian cycle
0 references
sufficient condition
0 references
