Decomposing locally semicomplete digraphs into strong spanning subdigraphs

DOI10.1016/j.jctb.2011.09.001zbMath1241.05039OpenAlexW2040255444MaRDI QIDQ414643

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

zbMATH Keywords

connectivityHamiltonian cyclelocally semicomplete digraphdecomposition into strong spanning subdigraphsstrong spanning subdigraphstructure of locally semicomplete digraphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Related Items (15)

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 Hamiltonian paths in non-round decomposable local tournaments ⋮ Good orientations of unions of edge‐disjoint spanning trees ⋮ Arc‐disjoint in‐ and out‐branchings in digraphs of independence number at most 2 ⋮ Packing strong subgraph in digraphs ⋮ Arc-disjoint spanning sub(di)graphs in digraphs ⋮ Arc-disjoint Hamiltonian cycles in round decomposable locally semicomplete digraphs ⋮ Arc-disjoint Hamiltonian paths in strong round decomposable local tournaments ⋮ Strong subgraph connectivity of digraphs ⋮ Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs ⋮ Complexity of some arc-partition problems for digraphs ⋮ Locally Semicomplete Digraphs and Generalizations ⋮ Smallest number of vertices in a 2-arc-strong digraph without good pairs ⋮ Disjoint sub(di)graphs in digraphs

Cites Work

• Unnamed Item
• Decomposing \(k\)-arc-strong tournaments into strong spanning subdigraphs
• Edge-disjoint in- and out-branchings in tournaments and related path problems
• A classification of locally semicomplete digraphs
• On the structure of local tournaments
• Locally semicomplete digraphs: A generalization of tournaments
• Hamilton decompositions of regular tournaments
• Edge-Disjoint Hamiltonian Paths and Cycles in Tournaments
• Connectivity properties of locally semicomplete digraphs
• Digraphs

This page was built for publication: Decomposing locally semicomplete digraphs into strong spanning subdigraphs