Decomposing locally semicomplete digraphs into strong spanning subdigraphs
From MaRDI portal
(Redirected from Publication:414643)
Recommendations
- Arc-disjoint strong spanning subdigraphs of semicomplete compositions
- Arc-disjoint in- and out-branchings with the same root in locally semicomplete digraphs
- Decomposing and colouring some locally semicomplete digraphs
- Arc-disjoint Hamiltonian cycles in round decomposable locally semicomplete digraphs
- On complementary cycles in locally semicomplete digraphs
Cites work
- scientific article; zbMATH DE number 4164908 (Why is no real title available?)
- A classification of locally semicomplete digraphs
- Connectivity properties of locally semicomplete digraphs
- Decomposing \(k\)-arc-strong tournaments into strong spanning subdigraphs
- Digraphs
- Edge-Disjoint Hamiltonian Paths and Cycles in Tournaments
- Edge-disjoint in- and out-branchings in tournaments and related path problems
- Hamilton decompositions of regular tournaments
- Locally semicomplete digraphs: A generalization of tournaments
- On the structure of local tournaments
Cited in
(19)- Arc‐disjoint in‐ and out‐branchings in digraphs of independence number at most 2
- Arc-disjoint Hamiltonian paths in strong round decomposable local tournaments
- Arc-disjoint Hamiltonian paths in non-round decomposable local tournaments
- Good orientations of unions of edge‐disjoint spanning trees
- The smallest number of vertices in a 2-arc-strong digraph without pair of arc-disjoint in- and out-branchings
- Minimally strong subgraph \((k,\ell ) \)-arc-connected digraphs
- Strong subgraph connectivity of digraphs
- Arc-disjoint spanning sub(di)graphs in digraphs
- Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs
- Strong arc decompositions of split digraphs
- Decomposing and colouring some locally semicomplete digraphs
- Arc-disjoint in- and out-branchings with the same root in locally semicomplete digraphs
- Packing strong subgraph in digraphs
- Locally Semicomplete Digraphs and Generalizations
- Complexity of some arc-partition problems for digraphs
- Smallest number of vertices in a 2-arc-strong digraph without good pairs
- Disjoint sub(di)graphs in digraphs
- Arc-disjoint Hamiltonian cycles in round decomposable locally semicomplete digraphs
- Arc-disjoint strong spanning subdigraphs of semicomplete compositions
This page was built for publication: Decomposing locally semicomplete digraphs into strong spanning subdigraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q414643)
