Decomposing locally semicomplete digraphs into strong spanning subdigraphs
DOI10.1016/J.JCTB.2011.09.001zbMATH Open1241.05039OpenAlexW2040255444MaRDI QIDQ414643FDOQ414643
Jing Huang, Jørgen Bang-Jensen
Publication date: 11 May 2012
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2011.09.001
Hamiltonian cycleconnectivitylocally semicomplete digraphdecomposition into strong spanning subdigraphsstrong spanning subdigraphstructure of locally semicomplete digraphs
Directed graphs (digraphs), tournaments (05C20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- A classification of locally semicomplete digraphs
- Locally semicomplete digraphs: A generalization of tournaments
- Connectivity properties of locally semicomplete digraphs
- Digraphs
- On the structure of local tournaments
- Title not available (Why is that?)
- Edge-disjoint in- and out-branchings in tournaments and related path problems
- Decomposing \(k\)-arc-strong tournaments into strong spanning subdigraphs
- Hamilton decompositions of regular tournaments
- Edge-Disjoint Hamiltonian Paths and Cycles in Tournaments
Cited In (17)
- 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
- Arc-Disjoint In- and Out-Branchings With the Same Root in Locally Semicomplete Digraphs
- Strong subgraph connectivity of digraphs
- Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs
- Strong arc decompositions of split digraphs
- Arc-disjoint spanning sub(di)graphs in 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
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)
