A simple algorithm for finding a cycle of length greater than three and without diagonals (Q1147514)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A simple algorithm for finding a cycle of length greater than three and without diagonals |
scientific article; zbMATH DE number 3703985
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple algorithm for finding a cycle of length greater than three and without diagonals |
scientific article; zbMATH DE number 3703985 |
Statements
A simple algorithm for finding a cycle of length greater than three and without diagonals (English)
0 references
1981
0 references
algorithm
0 references
cycle
0 references
0 references
0 references
