Cycles through ten vertices in 3-connected cubic graphs (Q2266024)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cycles through ten vertices in 3-connected cubic graphs |
scientific article |
Statements
Cycles through ten vertices in 3-connected cubic graphs (English)
0 references
1984
0 references
The authors investigate the problem of finding a cycle containing a prescribed set of vertices and edges in a cubic 3-connected graph. The main result says that any such graph has a cycle through any ten vertices unless the graph is contractible to the Petersen graph. This result has been announced independently by A. K. Kelmans and M. V. Lomonosov.
0 references
cycle
0 references
cubic 3-connected graph
0 references
