Making a tournament \(k\)-arc-strong by reversing or deorienting arcs.

DOI10.1016/S0166-218X(03)00438-4zbMath1035.05045MaRDI QIDQ1427175

Anders Yeo, Jörgen Bang-Jensen

Publication date: 14 March 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

ConnectivityFlowsTournamentArc reversalDeorienting arcsSemicomplete digraph

Mathematics Subject Classification ID

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

Related Items (4)

Complexity of (arc)-connectivity problems involving arc-reversals or deorientations ⋮ Making a tournament k $k$‐strong ⋮ Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs ⋮ Tournaments and Semicomplete Digraphs

Cites Work

• Adding and Reversing Arcs in Semicomplete Digraphs
• Digraphs
• Unnamed Item

This page was built for publication: Making a tournament \(k\)-arc-strong by reversing or deorienting arcs.