Adding and Reversing Arcs in Semicomplete Digraphs

DOI10.1017/S0963548397003179MaRDI QIDQ4383733zbMATH OpenOpenAlexFDO

Authors Jørgen Bang-Jensen, Tibor Jordán

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

zbMATH Keywords

connectivitysemicomplete digraph

Mathematics Subject Classification ID

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

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

Cited in

(9)

• Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs
• Making a tournament \(k\)-arc-strong by reversing or deorienting arcs.
• Increasing digraph arc-connectivity by arc addition, reversal and complement
• Making a tournament k-arc-strong by reversing arcs
• scientific article; zbMATH DE number 6379051 (Why is no real title available?)
• Tournaments and Semicomplete Digraphs
• scientific article; zbMATH DE number 3889551 (Why is no real title available?)
• scientific article; zbMATH DE number 3865311 (Why is no real title available?)
• Making a tournament k $k$‐strong

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)