Spanning 2-strong tournaments in 3-strong semicomplete digraphs
From MaRDI portal
Publication:968409
DOI10.1016/J.DISC.2009.04.019zbMATH Open1221.05172OpenAlexW2001055462MaRDI QIDQ968409FDOQ968409
Authors: 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
Recommendations
- Spanning k‐arc‐strong subdigraphs with few arcs in k‐arc‐strong tournaments
- Making a tournament k $k$‐strong
- \(k\)-strong spanning local tournaments in locally semicomplete digraphs
- Spanning acyclic subdigraphs and strong \(t\)-panconnectivity of tournaments
- A note on spanning local tournaments in locally semicomplete digraphs
Cites Work
Cited In (15)
- \(k\)-strong spanning local tournaments in locally semicomplete digraphs
- A note on spanning local tournaments in locally semicomplete digraphs
- Spanning k‐arc‐strong subdigraphs with few arcs in k‐arc‐strong tournaments
- Trail-connected tournaments
- Spanning 3-strong tournaments in 5-strong semicomplete digraphs
- Spanning multipartite tournaments of semicomplete multipartite digraphs.
- The minimum spanning strong subdigraph problem for extended semicomplete digraphs and semicomplete bipartite digraphs
- Tournaments and Semicomplete Digraphs
- Hamiltonian cycles avoiding prescribed arcs in semicomplete digraphs
- Spanning eulerian subdigraphs in semicomplete digraphs
- Spanning acyclic subdigraphs and strong \(t\)-panconnectivity of tournaments
- Improved results on linkage problems
- Arc-disjoint strong spanning subdigraphs of semicomplete compositions
- On the spanning connectivity of tournaments
- Spanning Eulerian subdigraphs avoiding \(k\) prescribed arcs in tournaments
This page was built for publication: Spanning 2-strong tournaments in 3-strong semicomplete digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968409)
