Ádám's Conjecture and Arc Reversal Problems
A. Ádám conjectured that for any non-acyclic digraph D, there exists an arc whose reversal reduces the total number of cycles in D. In this thesis we characterize and identify structure common to all digraphs for which Ádám's conjecture holds. We investigate quasi-acyclic digraphs and verify th...
Main Author: | |
---|---|
Format: | Others |
Published: |
CSUSB ScholarWorks
2016
|
Subjects: | |
Online Access: | https://scholarworks.lib.csusb.edu/etd/337 https://scholarworks.lib.csusb.edu/cgi/viewcontent.cgi?article=1409&context=etd |