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.
|Journal||Journal of Combinatorial Theory. Series B|
|Publication status||Published - 2023|
- Arc reversals
- Directed cycles
- Oriented graphs