Using a variation of Thomassen's admissible triples technique, we give an a
lternative proof that every strongly 2-arc-connected directed graph with tw
o or more vertices contains a directed cycle that has at least two chords,
while at the sa me time establishing a more general result, (C) 1999 John W
iley & Sons, Inc.