Spanning local tournaments in locally semicomplete digraphs

DOI10.1016/S0166-218X(97)00037-1zbMath0884.05047OpenAlexW2012133501MaRDI QIDQ1372735

Yubao Guo

Publication date: 18 November 1997

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

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

digraphconnected spanning local tournament

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (12)

Every \((13k - 6)\)-strong tournament with minimum out-degree at least \(28k - 13\) is \(k\)-linked ⋮ Path-connectivity in local tournaments ⋮ 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 ⋮ Spanning 2-strong tournaments in 3-strong semicomplete digraphs ⋮ On 1-factors with prescribed lengths in tournaments ⋮ A note on spanning local tournaments in locally semicomplete digraphs ⋮ Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs ⋮ Tournaments and Semicomplete Digraphs ⋮ Locally Semicomplete Digraphs and Generalizations

Cites Work

• Locally semicomplete digraphs: A generalization of tournaments
• Connectivity properties of locally semicomplete digraphs
• Unnamed Item

This page was built for publication: Spanning local tournaments in locally semicomplete digraphs