Premium
Directed cycles with chords
Author(s) -
Marcus Daniel A.
Publication year - 1999
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/(sici)1097-0118(199905)31:1<17::aid-jgt3>3.0.co;2-q
Subject(s) - mathematics , combinatorics , directed graph , graph , discrete mathematics
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