Pages that link to "Item:Q1405121"

The following pages link to Every strong digraph has a spanning strong subgraph with at most \(n+2\alpha-2\) arcs (Q1405121):

Displaying 3 items.

• An algorithmic metatheorem for directed treewidth (Q266806) (← links)
• The minimum spanning strong subdigraph problem is fixed parameter tractable (Q1005234) (← links)
• Locally Semicomplete Digraphs and Generalizations (Q3120438) (← links)