Making a tournament k k‐strong

DOI10.1002/JGT.22900MaRDI QIDQ6094049zbMATH OpenOpenAlexFDO

Authors Jørgen Bang-Jensen, Kasper Skov Johansen, A. Yeo

Publication date 9 October 2023

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

directed vertex-connectivity augmentationincreasing connectivityone-way pairssemicomplete digraphtournament

Mathematics Subject Classification ID

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

Recommendations

• Making a tournament k-arc-strong by reversing arcs
• scientific article; zbMATH DE number 2192120
• Making a tournament \(k\)-arc-strong by reversing or deorienting arcs.
• scientific article; zbMATH DE number 4043867
• Tournaments and the strong Erdős-Hajnal property
• scientific article; zbMATH DE number 5178703
• scientific article; zbMATH DE number 1355287
• scientific article; zbMATH DE number 1416469
• Making a tournament indecomposable by one subtournament-reversal operation
• scientific article; zbMATH DE number 3885940

Cites work

• Adding and Reversing Arcs in Semicomplete Digraphs
• Digraphs
• Directed vertex-connectivity augmentation
• scientific article; zbMATH DE number 3580570 (Why is no real title available?)
• Making a tournament \(k\)-arc-strong by reversing or deorienting arcs.
• Minimal edge-coverings of pairs of sets

Cited in

(6)

• Making a tournament \(k\)-arc-strong by reversing or deorienting arcs.
• Making a tournament k-arc-strong by reversing arcs
• Adding and Reversing Arcs in Semicomplete Digraphs
• On the minimum number of inversions to make a digraph k-(arc-)strong
• On the minimum number of inversions to make a digraph k-(arc-)strong (extended abstract)
• Spanning 2-strong tournaments in 3-strong semicomplete digraphs

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

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