Longest cycles in 3-connected cubic graphs

Abstract We verify a conjecture of J. A. Bondy and M. Simonovits ( Canad. J. Math. 32 , No. 4 (1980), 987–992) by showing that there exists a constant c > 0 such that every 3-connected cubic graph G has a cycle of length at least | G | c .

[1]  T. Motzkin,et al.  Longest Simple Paths in Polyhedral Graphs , 1962 .

[2]  J. A. Bondy,et al.  Longest Cycles in 2-Connected Graphs with Prescribed Maximum Degree , 1980, Canadian Journal of Mathematics.

[3]  W. T. Tutte.  A THEOREM ON PLANAR GRAPHS , 1956 .

[4]  Hansjoachim Walther,et al.  Shortness Exponents of Families of Graphs , 1973, J. Comb. Theory, Ser. A.

[5]  D. Barnette.  Trees in Polyhedral Graphs , 1966, Canadian Journal of Mathematics.

[6]  Miklós Simonovits,et al.  Longest Cycles in 3-Connected 3-Regular Graphs , 1980, Canadian Journal of Mathematics.

[7]  Brad Jackson,et al.  A shortness exponent for r-regular r-connected graphs , 1982, J. Graph Theory.

[8]  W. T. Tutte.  On Hamiltonian Circuits , 1946 .