Spanning 2-strong tournaments in 3-strong semicomplete digraphs

DOI10.1016/j.disc.2009.04.019zbMath1221.05172OpenAlexW2001055462MaRDI QIDQ968409

Tibor Jordán, Jörgen Bang-Jensen

Publication date: 5 May 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.04.019

zbMATH Keywords

tournamentsemicomplete digraphconnectivity of digraphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items

Spanning eulerian subdigraphs in semicomplete digraphs ⋮ Spanning 3-strong tournaments in 5-strong semicomplete digraphs ⋮ Improved results on linkage problems ⋮ \(k\)-strong spanning local tournaments in locally semicomplete digraphs ⋮ Tournaments and Semicomplete Digraphs

Cites Work

• Unnamed Item
• \(k\)-strong spanning local tournaments in locally semicomplete digraphs
• Spanning local tournaments in locally semicomplete digraphs
• Locally semicomplete digraphs: A generalization of tournaments
• Digraphs