A new sufficient condition for hamiltonicity of graphs (Q844185): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2006.01.003 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2065858897 / rank | |||
Normal rank | |||
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: On Hamiltonian cycles and Hamiltonian paths / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Revision as of 09:00, 2 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A new sufficient condition for hamiltonicity of graphs |
scientific article |
Statements
A new sufficient condition for hamiltonicity of graphs (English)
0 references
18 January 2010
0 references
combinatorial problems
0 references
graphs
0 references
Hamiltonian cycles
0 references
Hamiltonian paths
0 references