Adding and Reversing Arcs in Semicomplete Digraphs

DOI10.1017/S0963548397003179zbMATH Open0892.05019OpenAlexW2066999934MaRDI QIDQ4383733FDOQ4383733

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

Recommendations

• Making a tournament k $k$‐strong
• Increasing digraph arc-connectivity by arc addition, reversal and complement
• scientific article; zbMATH DE number 3865311
• Making a tournament \(k\)-arc-strong by reversing arcs

zbMATH Keywords

connectivitysemicomplete digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Connectivity (05C40)

Cited In (8)

• Increasing digraph arc-connectivity by arc addition, reversal and complement
• Title not available (Why is that?)
• Tournaments and Semicomplete Digraphs
• Making a tournament k $k$‐strong
• Title not available (Why is that?)
• Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs
• Title not available (Why is that?)
• Making a tournament \(k\)-arc-strong by reversing or deorienting arcs.

This page was built for publication: Adding and Reversing Arcs in Semicomplete Digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4383733)