Spanning local tournaments in locally semicomplete digraphs
From MaRDI portal
(Redirected from Publication:1372735)
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
Cites work
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
- A note on spanning local tournaments in locally semicomplete digraphs
- Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties
- scientific article; zbMATH DE number 403948 (Why is no real title available?)
- Spanning 3-strong tournaments in 5-strong semicomplete digraphs
- Spanning multipartite tournaments of semicomplete multipartite digraphs.
- Tournaments and Semicomplete Digraphs
- Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs
- Hamiltonian cycles avoiding prescribed arcs in semicomplete digraphs
- Spanning eulerian subdigraphs in semicomplete 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)
