An efficient condition for a graph to be Hamiltonian (Q2383542): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q1617014 |
Changed an Item |
||
| Property / author | |||
| Property / author: Sheng-Jia Li / rank | |||
Normal rank | |||
Revision as of 19:13, 28 February 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
