An efficient condition for a graph to be Hamiltonian (Q2383542): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.dam.2007.03.013 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2021488373 / rank | |||
Normal rank |
Revision as of 00:02, 20 March 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