Spanning k‐arc‐strong subdigraphs with few arcs in k‐arc‐strong tournaments

DOI10.1002/jgt.20004zbMath1057.05039OpenAlexW4249649555MaRDI QIDQ4810501

Anders Yeo, Jing Huang, Jörgen Bang-Jensen

Publication date: 16 August 2004

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20004

zbMATH Keywords

connectivitydigraphspolynomial algorithmtournamentMSSS problemcertificates for connectivityMEG problemminimum strong spanning subgraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

Sparse Spanning $k$-Connected Subgraphs in Tournaments ⋮ Sparse Highly Connected Spanning Subgraphs in Dense Directed Graphs ⋮ Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs ⋮ Tournaments and Semicomplete Digraphs

Cites Work

• An Algorithm for Finding a Minimal Equivalent Graph of a Digraph
• Unnamed Item

This page was built for publication: Spanning k‐arc‐strong subdigraphs with few arcs in k‐arc‐strong tournaments