Decomposing \(k\)-arc-strong tournaments into strong spanning subdigraphs
From MaRDI portal
Publication:558238
DOI10.1007/s00493-004-0021-zzbMath1064.05067OpenAlexW2063292662MaRDI QIDQ558238
Jörgen Bang-Jensen, Anders Yeo
Publication date: 5 July 2005
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-004-0021-z
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)
Related Items
Small degree out‐branchings ⋮ Minimally strong subgraph \((k,\ell ) \)-arc-connected digraphs ⋮ Antistrong digraphs ⋮ Good orientations of unions of edge‐disjoint spanning trees ⋮ A survey on Hamilton cycles in directed graphs ⋮ Packing strong subgraph in digraphs ⋮ Decomposing locally semicomplete digraphs into strong spanning subdigraphs ⋮ Arc‐disjoint out‐branchings and in‐branchings in semicomplete digraphs ⋮ Arc-disjoint spanning sub(di)graphs in digraphs ⋮ Strong subgraph connectivity of digraphs ⋮ Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs ⋮ Complexity of some arc-partition problems for digraphs ⋮ Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs ⋮ Tournaments and Semicomplete Digraphs ⋮ Disjoint sub(di)graphs in digraphs ⋮ Non-separating spanning trees and out-branchings in digraphs of independence number 2
This page was built for publication: Decomposing \(k\)-arc-strong tournaments into strong spanning subdigraphs
