Adding and Reversing Arcs in Semicomplete Digraphs
From MaRDI portal
Publication:4383733
DOI10.1017/S0963548397003179zbMath0892.05019OpenAlexW2066999934MaRDI QIDQ4383733
Tibor Jordán, Jörgen Bang-Jensen
Publication date: 2 April 1998
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548397003179
Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)
Related Items
Making a tournament k $k$‐strong, Making a tournament \(k\)-arc-strong by reversing or deorienting arcs., Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs, Tournaments and Semicomplete Digraphs