Topic: Directed Graphs and Tournaments

Transitive Tournaments and Acyclicity

Tournaments and Their Basic Structure

Tournament Scores and Degree Constraints

Topological Orders and Linear Extensions

Testing Candidate Kernels in Small Digraphs

Strong Connectivity and Strong Components

Source-Removal Topological Sorting

Redei’s Theorem by Vertex Insertion

Proving the DAG-Ordering Characterization

Modeling Precedence Constraints with DAGs