How to make a strongly connected digraph two-connected

DOI10.1007/3-540-59408-6_69MaRDI QIDQ5101433zbMATH OpenOpenAlexFDO

Authors

Publication date 30 August 2022

Published in Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://ir.cwi.nl/pub/1414

zbMATH Keywords

combinatorial polynomial algorithm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Recommendations

• Making bidirected graphs strongly connected
• How to make a graph four-connected
• Strong subgraph connectivity of digraphs
• (Strong) proper vertex connection of some digraphs
• (Strong) total proper connection of some digraphs
• Making a dominating set of a graph connected
• scientific article; zbMATH DE number 4160762
• scientific article; zbMATH DE number 4150206
• Making the components of a graph \(k\)-connected
• scientific article; zbMATH DE number 1216570

Cites work

• scientific article; zbMATH DE number 1263261 (Why is no real title available?)
• A minimum 3-connectivity augmentation of a graph
• Augmentation Problems
• Augmenting Graphs to Meet Edge-Connectivity Requirements
• Edge-connectivity augmentation problems
• Minimal edge-coverings of pairs of sets
• On the optimal vertex-connectivity augmentation

Cited in

(2)

• Minimum 2-vertex strongly biconnected spanning directed subgraph problem
• Making bidirected graphs strongly connected

This page was built for publication: How to make a strongly connected digraph two-connected

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