Longest Cycles in 3-Connected 3-Regular Graphs
1980 ◽
Vol 32
(4)
◽
pp. 987-992
◽
Keyword(s):
In this paper, we study the following question: How long a cycle must there be in a 3-connected 3-regular graph on n vertices? For planar graphs this question goes back to Tait [6], who conjectured that any planar 3-connected 3-regular graph is hamiltonian. Tutte [7] disproved this conjecture by finding a counterexample on 46 vertices. Using Tutte's example, Grunbaum and Motzkin [3] constructed an infinite family of 3-connected 3-regular planar graphs such that the length of a longest cycle in each member of the family is at most nc, where c = 1 – 2–17 and n is the number of vertices. The exponent c was subsequently reduced by Walther [8, 9] and by Grùnbaum and Walther [4].
Keyword(s):
Keyword(s):
2002 ◽
Vol 251
(1-3)
◽
pp. 103-107
◽
1966 ◽
Vol 18
◽
pp. 1091-1094
◽
2011 ◽
Vol 32
(6)
◽
pp. 1805-1835
◽
Keyword(s):
1986 ◽
Vol 41
(2)
◽
pp. 193-210
◽
Keyword(s):