Spanning local tournaments in locally semicomplete digraphs

DOI10.1016/S0166-218X(97)00037-1zbMATH Open0884.05047OpenAlexW2012133501MaRDI QIDQ1372735FDOQ1372735

Authors: 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

Recommendations

• A note on spanning local tournaments in locally semicomplete digraphs
• Spanning 2-strong tournaments in 3-strong semicomplete digraphs
• Spanning multipartite tournaments of semicomplete multipartite digraphs.
• \(k\)-strong spanning local tournaments in locally semicomplete digraphs
• Strongly Hamiltonian-connected locally semicomplete digraphs

zbMATH Keywords

digraphconnected spanning local tournament

Mathematics Subject Classification ID

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

Cites Work

• Locally semicomplete digraphs: A generalization of tournaments
• Connectivity properties of locally semicomplete digraphs
• Title not available (Why is that?)

Cited In (17)

• \(k\)-strong spanning local tournaments in locally semicomplete digraphs
• Spanning 2-strong tournaments in 3-strong semicomplete digraphs
• Every \((13k - 6)\)-strong tournament with minimum out-degree at least \(28k - 13\) is \(k\)-linked
• Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties
• A note on spanning local tournaments in locally semicomplete digraphs
• Title not available (Why is that?)
• Spanning 3-strong tournaments in 5-strong semicomplete digraphs
• Spanning multipartite tournaments of semicomplete multipartite digraphs.
• Tournaments and Semicomplete Digraphs
• Hamiltonian cycles avoiding prescribed arcs in semicomplete digraphs
• Spanning eulerian subdigraphs in semicomplete digraphs
• Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs
• Path-connectivity in local tournaments
• On 1-factors with prescribed lengths in tournaments
• Sparse spanning \(k\)-connected subgraphs in tournaments
• Locally Semicomplete Digraphs and Generalizations
• Improved results on linkage problems

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

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