An efficient condition for a graph to be Hamiltonian (Q2383542): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.dam.2007.03.013 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2007.03.013 / rank | |||
Normal rank | |||
Latest revision as of 07:50, 18 December 2024
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
