Decomposing k-arc-strong tournaments into strong spanning subdigraphs

DOI10.1007/S00493-004-0021-ZMaRDI QIDQ558238zbMATH OpenOpenAlexFDO

Authors Jørgen Bang-Jensen, A. 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

zbMATH Keywords

decompositionHamiltonian cyclesKelly conjecture

Mathematics Subject Classification ID

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

Recommendations

• Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
• Decomposing tournaments into paths
• Spanning k‐arc‐strong subdigraphs with few arcs in k‐arc‐strong tournaments
• Decomposing tournaments into paths
• Edge disjoint Hamiltonian cycles in highly connected tournaments

Cited in

(20)

• Arc-disjoint out- and in-branchings in compositions of digraphs
• Decomposing locally semicomplete digraphs into strong spanning subdigraphs
• Non-separating spanning trees and out-branchings in digraphs of independence number 2
• Good orientations of unions of edge‐disjoint spanning trees
• Small degree out‐branchings
• Minimally strong subgraph \((k,\ell ) \)-arc-connected digraphs
• A survey on Hamilton cycles in directed graphs
• 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
• Antistrong digraphs
• Arc‐disjoint out‐branchings and in‐branchings in semicomplete digraphs
• Tournaments and Semicomplete Digraphs
• Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs
• Packing strong subgraph in digraphs
• Complexity of some arc-partition problems for digraphs
• Spanning acyclic subdigraphs and strong \(t\)-panconnectivity of tournaments
• \(k\)-ary spanning trees contained in tournaments
• Disjoint sub(di)graphs in digraphs

This page was built for publication: Decomposing \(k\)-arc-strong tournaments into strong spanning subdigraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q558238)