Making a tournament k-arc-strong by reversing arcs

MaRDI QIDQ2816010zbMATH OpenFDO

Authors A. Yeo, Jørgen Bang-Jensen

Publication date 1 July 2016

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571065305800642?np=y

zbMATH Keywords

digraphstournamentsemicomplete digrapharc reversalsubmodular flows\(k\)-arc-strong\(k\)-strong connectivity

Mathematics Subject Classification ID

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

Recommendations

• Making a tournament \(k\)-arc-strong by reversing or deorienting arcs.
• Making a tournament k $k$‐strong
• Adding and Reversing Arcs in Semicomplete Digraphs
• Arc reversals in tournaments
• Spanning k‐arc‐strong subdigraphs with few arcs in k‐arc‐strong tournaments

Cited in

(6)

• Reversing arcs in transitive tournaments to obtain maximum number of spanning cycles.
• Arc reversals in tournaments
• Making a tournament k $k$‐strong
• Making a tournament \(k\)-arc-strong by reversing or deorienting arcs.
• An extremal connectivity parameter of tournaments
• scientific article; zbMATH DE number 2114681 (Why is no real title available?)

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

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