Spanning 2-strong tournaments in 3-strong semicomplete digraphs

DOI10.1016/J.DISC.2009.04.019zbMATH Open1221.05172OpenAlexW2001055462MaRDI QIDQ968409FDOQ968409

Jørgen Bang-Jensen, Tibor Jordán

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)

Cites Work

• Title not available (Why is that?)
• Locally semicomplete digraphs: A generalization of tournaments
• Digraphs
• Spanning local tournaments in locally semicomplete digraphs
• \(k\)-strong spanning local tournaments in locally semicomplete digraphs

Cited In (8)

• \(k\)-strong spanning local tournaments in locally semicomplete digraphs
• A note on spanning local tournaments in locally semicomplete digraphs
• Spanning 3-strong tournaments in 5-strong semicomplete 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

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)