Pages that link to "Item:Q4443090"
From MaRDI portal
The following pages link to Strongly Connected Spanning Subdigraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs (Q4443090):
Displaying 16 items.
- An algorithmic metatheorem for directed treewidth (Q266806) (← links)
- Minimum cycle factors in quasi-transitive digraphs (Q924641) (← links)
- The minimum spanning strong subdigraph problem is fixed parameter tractable (Q1005234) (← links)
- Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs (Q1045053) (← links)
- Minimal arc-sets spanning dicycles (Q1707911) (← links)
- On strongly connected digraphs with bounded cycle length (Q1923587) (← links)
- Chordality of locally semicomplete and weakly quasi-transitive digraphs (Q2022148) (← links)
- Longest path partitions in generalizations of tournaments (Q2501556) (← links)
- Kernels in quasi-transitive digraphs (Q2501570) (← links)
- The minimum spanning strong subdigraph problem for extended semicomplete digraphs and semicomplete bipartite digraphs (Q2765953) (← links)
- Locally Semicomplete Digraphs and Generalizations (Q3120438) (← links)
- Semicomplete Multipartite Digraphs (Q3120439) (← links)
- Quasi-Transitive Digraphs and Their Extensions (Q3120440) (← links)
- Sparse Highly Connected Spanning Subgraphs in Dense Directed Graphs (Q5222543) (← links)
- Sparse Spanning $k$-Connected Subgraphs in Tournaments (Q5361237) (← links)
- Semicomplete compositions of digraphs (Q6041548) (← links)
