Abstract A cycle of order k is called a k -cycle. A non-induced cycle is called a chorded cycle. Let n be an integer with n ≥ 4 . Then a graph G of order n is chorded pancyclic if G contains a chorded k -cycle for every integer k with 4 ≤ k ≤ n . Cream, Gould and Hirohata (Australas. J. Combin. 67 (2017), 463–469) proved that a graph of order n satisfying deg G u + deg G v ≥ n for every pair of nonadjacent vertices u , v in G is chorded pancyclic unless G is either K n 2 , n 2 or K 3 □ K 2 , the Cartesian product of K 3 and K 2 . They also conjectured that if G is Hamiltonian, we can replace the degree sum condition with the weaker density condition | E ( G ) | ≥ 1 4 n 2 and still guarantee the same conclusion. In this paper, we prove this conjecture by showing that if a graph G of order n with | E ( G ) | ≥ 1 4 n 2 contains a k -cycle, then G contains a chorded k -cycle, unless k = 4 and G is either K n 2 , n 2 or K 3 □ K 2 , Then observing that K n 2 , n 2 and K 3 □ K 2 are exceptions only for k = 4 , we further relax the density condition for sufficiently large k .
[1]
C. Godsil,et al.
Cycles in graphs
,
1985
.
[2]
G. Chartrand,et al.
Graphs & Digraphs
,
1986
.
[3]
J. Bondy,et al.
Pancyclic graphs II
,
1971
.
[4]
Stephan Brandt,et al.
A Sufficient Condition for All Short Cycles
,
1997,
Discret. Appl. Math..
[5]
Carsten Thomassen.
Chords in longest cycles
,
2018,
J. Comb. Theory, Ser. B.
[6]
Béla Bollobás,et al.
Weakly Pancyclic Graphs
,
1999,
J. Comb. Theory, Ser. B.
[7]
Richard H. Schelp,et al.
Degree conditions for hamiltonicity: Counting the number of missing edges
,
2007,
Discret. Math..
[8]
Ronald J. Gould,et al.
A note on extending Bondy's meta-conjecture
,
2017,
Australas. J Comb..
[9]
Carsten Thomassen,et al.
Independent Dominating Sets and a Second Hamiltonian Cycle in Regular Graphs
,
1998,
J. Comb. Theory, Ser. B.
[10]
Carsten Thomassen,et al.
Configurations in Graphs of Large Minimum Degree, Connectivity, or Chromatic Number
,
1989
.