Directed cycles with chords

Using a variation of Thomassen's admissible triples technique, we give an alternative proof that every strongly 2‐arc‐connected directed graph with two or more vertices contains a directed cycle that has at least two chords, while at the same time establishing a more general result. © 1999 John Wiley & Sons, Inc. J Graph Theory 31:17–28, 1999