Pages that link to "Item:Q1405121"
From MaRDI portal
The following pages link to Every strong digraph has a spanning strong subgraph with at most \(n+2\alpha-2\) arcs (Q1405121):
Displaying 9 items.
- An algorithmic metatheorem for directed treewidth (Q266806) (← links)
- On spanning galaxies in digraphs (Q415275) (← links)
- Spannning a strong digraph by \(\alpha\) circuits: a proof of Gallai's conjecture (Q949757) (← links)
- The minimum spanning strong subdigraph problem is fixed parameter tractable (Q1005234) (← links)
- Variations on the Gallai-Milgram theorem (Q1112833) (← links)
- Covering a strong digraph by \(\alpha-1\) disjoint paths: A proof of Las Vergnas' conjecture (Q1850573) (← links)
- Locally Semicomplete Digraphs and Generalizations (Q3120438) (← links)
- Integer Programming and Combinatorial Optimization (Q5712448) (← links)
- 4-Free Strong Digraphs with the Maximum Size (Q6135737) (← links)