On minimally 2-T-connected directed graphs

DOI10.1016/J.DAM.2018.04.003MaRDI QIDQ1801059zbMATH OpenOpenAlexFDO

Authors Olivier Durand de Gevigney, Zoltán Szigeti

Publication date 26 October 2018

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2018.04.003

zbMATH Keywords

vertex-connectivityarc-connectivity

Mathematics Subject Classification ID

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

Recommendations

• On Vertices of outdegree n in minimally n‐connected digraphs
• Publication:4946545
• scientific article; zbMATH DE number 878899
• On extremal \(k\)-outconnected graphs
• Minimal n-fach zusammenhängende Digraphen. (Minimally n-connected digraphs)

Cites work

• scientific article; zbMATH DE number 3627227 (Why is no real title available?)
• A Reduction Method for Edge-Connectivity in Graphs
• On Vertices of outdegree n in minimally n‐connected digraphs

Cited in

(3)

• The complexity of 2-vertex-connected orientation in mixed graphs
• scientific article; zbMATH DE number 3889551 (Why is no real title available?)
• 2-Connectivity in Directed Graphs (Invited Talk)

This page was built for publication: On minimally 2-\(T\)-connected directed graphs

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