Chords in longest cycles

Abstract If a graph G is 3-connected and has minimum degree at least 4, then some longest cycle in G has a chord. If G is 2-connected and cubic, then every longest cycle in G has a chord.

[1]  Etienne Birmelé.  Every longest circuit of a 3-connected, K3, 3-minor free graph has a chord , 2008, J. Graph Theory.

[2]  Elwood S. Buffa,et al.  Graph Theory with Applications , 1977 .

[3]  Carsten Thomassen,et al.  Chords of Longest Cycles in Cubic Graphs , 1997, J. Comb. Theory, Ser. B.

[4]  A. Thomason.  Hamiltonian Cycles and Uniquely Edge Colourable Graphs , 1978 .

[5]  Carsten Thomassen,et al.  Independent Dominating Sets and a Second Hamiltonian Cycle in Regular Graphs , 1998, J. Comb. Theory, Ser. B.

[6]  Hajo Broersma,et al.  Removable Edges and Chords of Longest Cycles in 3-Connected Graphs , 2014, Graphs Comb..

[7]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[8]  Jacques Verstraëte,et al.  Independent dominating sets and hamiltonian cycles , 2007, J. Graph Theory.

[9]  Cun-Quan Zhang.  Longest cycles and their chords , 1987, J. Graph Theory.

[10]  Carsten Thomassen,et al.  On the Number of Hamiltonian Cycles in Bipartite Graphs , 1996, Combinatorics, Probability and Computing.

[11]  Cun-Quan Zhang,et al.  Chords of longest circuits of graphs embedded in torus and Klein bottle , 2003, J. Graph Theory.

[12]  Etienne Birmelé.  Every longest circuit of a 3-connected, K 3,3 -minor free graph has a chord , 2008 .

[13]  Carsten Thomassen,et al.  Configurations in Graphs of Large Minimum Degree, Connectivity, or Chromatic Number , 1989 .

[14]  Michael Stiebitz,et al.  A solution to a colouring problem of P. Erdös , 1992, Discret. Math..

[15]  Cun-Quan Zhang,et al.  Chords of longest circuits in 3-connected graphs , 2003, Discret. Math..

[16]  Holger Schlingloff.  Cycles in Graphs , 2011, Algorithms Unplugged.

[17]  Matthias Kriesell,et al.  What is on his mind? , 2010, Discret. Math..

[18]  Ken-ichi Kawarabayashi,et al.  Chords of longest circuits in locally planar graphs , 2007, Eur. J. Comb..