Table of Contents
- Title Page
- About the HTML Version
- Acknowledgements
- List of Figures
- List of Tables
- Introduction
- Chapter 1: Even Cycles in Directed Graphs
- Introduction
- Walks, Trails, and Cycles
- Connectivity Results
- Even Digraphs
- Restricted Versions
- Conclusion
- Chapter 2: L-Matrices and Sign-solvability
- Introduction
- Sign-solvability
- L-matrices
- S-matrices
- Recognition
- Cycles in Matrices
- Signed Digraphs
- Conclusion
- Chapter 3: Beyond
- Introduction
- Balanced Labellings
- Distinguished Vertices
- Permanents
- Pfaffian Orientations
- Interval Matrices
- Cone-Systems
- Open Problems
- Conclusion
- Bibliography
- Appendix A: Computational Complexity
- Appendix B: Directed Graph Theory
- Appendix C: Relatives of the Even Cycle Problem
- Polynomial-Time (P) Problems
- NP-Complete (NPC) Problems
- NP-Hard Problems
- The Even Cycle Problem and Equivalent Ones