Abstract
We describe an infinite family of strongly 2-connected oriented graphs (that is, directed graphs with no multiple arcs) containing no arc whose reversal decreases the number of directed cycles.
Original language | English |
---|---|
Journal | Journal of Combinatorial Theory. Series B |
Volume | 161 |
Pages (from-to) | 15-20 |
ISSN | 0095-8956 |
DOIs | |
Publication status | Published - 2023 |
Keywords
- Arc reversals
- Directed cycles
- Oriented graphs