Cycles through 23 vertices in 3-connected cubic planar graphs (Q1961756)
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: Cycles through 23 vertices in 3-connected cubic planar graphs |
scientific article; zbMATH DE number 1394571
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cycles through 23 vertices in 3-connected cubic planar graphs |
scientific article; zbMATH DE number 1394571 |
Statements
Cycles through 23 vertices in 3-connected cubic planar graphs (English)
0 references
30 January 2000
0 references
It is shown that if \(G\) is a cubic 3-connected planar graph and \(X\) is any subset of \(V(G)\) of size at most \(23\), then \(G\) has a cycle containing all vertices of \(X\). It is also shown that this is best possible. The proof involves computer search.
0 references
Hamiltonian cycle
0 references
cubic graph
0 references
