Abstract
In Petersen's well-known cubic graph every vertex is missed by some longest cycle. Thomassen produced a planar graph with this property. Grunbaum found a cubic graph, in which any two vertices are missed by some longest cycle. In this paper we present a cubic planar graph fulfilling this condition.
| Original language | English |
|---|---|
| Pages (from-to) | 154-173 |
| Number of pages | 20 |
| Journal | Annals of the University of Craiova-mathematics and Computer Science Series |
| Volume | 33 |
| Publication status | Published - 2006 |
Keywords
- 3-connected
- Planar
- Cubic
- Graph