A HAMILTONIAN CONNECTIVITY PROPERTY OF REGULAR GRAPHS WITH FORBIDDEN SUBGRAPHS (Q3220628)
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 HAMILTONIAN CONNECTIVITY PROPERTY OF REGULAR GRAPHS WITH FORBIDDEN SUBGRAPHS |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A HAMILTONIAN CONNECTIVITY PROPERTY OF REGULAR GRAPHS WITH FORBIDDEN SUBGRAPHS |
scientific article |
Statements
A HAMILTONIAN CONNECTIVITY PROPERTY OF REGULAR GRAPHS WITH FORBIDDEN SUBGRAPHS (English)
0 references
1984
0 references
Hamiltonian cycles
0 references
regular graphs
0 references
0.95299804
0 references
0.9393049
0 references
0 references
0.9248143
0 references
0.9240888
0 references
0.9230421
0 references
