An efficient condition for a graph to be Hamiltonian (Q2383542): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: The Geng-Hua Fan conditions for pancyclic or Hamilton-connected graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5422499 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: New sufficient conditions for cycles in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Updating the hamiltonian problem—A survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Advances on the Hamiltonian problem -- a survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Note on Hamilton Circuits / rank | |||
Normal rank |
Latest revision as of 15:49, 26 June 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