A sufficient condition for pancyclic graphs (Q989551): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2009.05.009 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2071892226 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5422499 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new sufficient condition for hamiltonicity of graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An efficient condition for a graph to be Hamiltonian / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Hamiltonian cycles and Hamiltonian paths / rank | |||
Normal rank | |||
Latest revision as of 03:21, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A sufficient condition for pancyclic graphs |
scientific article |
Statements
A sufficient condition for pancyclic graphs (English)
0 references
20 August 2010
0 references
interconnection networks
0 references
Hamiltonian paths
0 references
Hamiltonian cycles
0 references
pancyclic graphs
0 references
sufficient conditions
0 references
