The following pages link to Packing directed circuits exactly (Q663091):
Displayed 14 items.
- Packing cycles in graphs. II (Q1405116) (← links)
- Ranking tournaments with no errors. II: Minimax relation (Q1985451) (← links)
- Digraphs of directed treewidth one (Q2005715) (← links)
- Colouring non-even digraphs (Q2094875) (← links)
- Some novel minimax results for perfect matchings of hexagonal systems (Q2166259) (← links)
- Ranking tournaments with no errors. I: Structural description (Q2284746) (← links)
- Recent techniques and results on the Erdős-Pósa property (Q2403789) (← links)
- Euler Digraphs (Q3120436) (← links)
- Erdös-Pósa Property of Obstructions to Interval Graphs (Q3304101) (← links)
- Even circuits in oriented matroids (Q5052170) (← links)
- On the Number of Vertex-Disjoint Cycles in Digraphs (Q5205389) (← links)
- Number of Fixed Points and Disjoint Cycles in Monotone Boolean Networks (Q5348493) (← links)
- Erdős–Pósa property of obstructions to interval graphs (Q6094044) (← links)
- Excluding a planar matching minor in bipartite graphs (Q6144397) (← links)