Making a tournament k $k$‐strong

DOI10.1002/jgt.22900zbMath1522.05243OpenAlexW4300961889MaRDI QIDQ6094049

Anders Yeo, Kasper Skov Johansen, Jörgen Bang-Jensen

Publication date: 9 October 2023

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

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

zbMATH Keywords

tournamentsemicomplete digraphdirected vertex-connectivity augmentationincreasing connectivityone-way pairs

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Directed vertex-connectivity augmentation
• Making a tournament \(k\)-arc-strong by reversing or deorienting arcs.
• Minimal edge-coverings of pairs of sets
• Adding and Reversing Arcs in Semicomplete Digraphs
• Digraphs

This page was built for publication: Making a tournament k $k$‐strong