Pages that link to "Item:Q1112061"
From MaRDI portal
The following pages link to Edge-disjoint in- and out-branchings in tournaments and related path problems (Q1112061):
Displaying 31 items.
- Parameterized algorithms for non-separating trees and branchings in digraphs (Q334949) (← links)
- Decomposing locally semicomplete digraphs into strong spanning subdigraphs (Q414643) (← links)
- Arc-disjoint spanning sub(di)graphs in digraphs (Q441857) (← links)
- Edge-disjoint paths in digraphs with bounded independence number (Q473097) (← links)
- Disjoint paths in tournaments (Q481696) (← links)
- A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph (Q990080) (← 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)
- Linkages in locally semicomplete digraphs and quasi-transitive digraphs (Q1297397) (← links)
- \(k\)-distinct in- and out-branchings in digraphs (Q1747490) (← links)
- On unitarity of spherical representations (Q1813346) (← links)
- The number of edge-disjoint transitive triples in a tournament (Q1886364) (← links)
- Complexity of some arc-partition problems for digraphs (Q2079880) (← links)
- Smallest number of vertices in a 2-arc-strong digraph without good pairs (Q2087467) (← links)
- Non-separating spanning trees and out-branchings in digraphs of independence number 2 (Q2102758) (← links)
- The smallest number of vertices in a 2-arc-strong digraph without pair of arc-disjoint in- and out-branchings (Q2149881) (← links)
- Arc-disjoint in- and out-branchings rooted at the same vertex in compositions of digraphs (Q2305930) (← links)
- On width measures and topological problems on semi-complete digraphs (Q2312615) (← links)
- Arc-disjoint paths and trees in 2-regular digraphs (Q2444565) (← links)
- Arc-disjoint paths in decomposable digraphs (Q2922218) (← links)
- Arc-Disjoint In- and Out-Branchings With the Same Root in Locally Semicomplete Digraphs (Q2930043) (← links)
- Tournaments and Semicomplete Digraphs (Q3120434) (← links)
- Locally Semicomplete Digraphs and Generalizations (Q3120438) (← links)
- Quasi-Transitive Digraphs and Their Extensions (Q3120440) (← links)
- Quasi‐transitive digraphs (Q4852401) (← links)
- Good orientations of unions of edge‐disjoint spanning trees (Q6055412) (← links)
- Arc‐disjoint in‐ and out‐branchings in digraphs of independence number at most 2 (Q6081563) (← links)
- Good acyclic orientations of 4‐regular 4‐connected graphs (Q6081883) (← links)
- Precedence-constrained arborescences (Q6109804) (← links)
- Arc‐disjoint out‐branchings and in‐branchings in semicomplete digraphs (Q6201032) (← links)
- Arc-disjoint out- and in-branchings in compositions of digraphs (Q6568855) (← links)
