How to make a strongly connected digraph two-connected
type: Item
instance of: scholarly article
title: How to make a strongly connected digraph two-connected
zbMATH Open document ID: 1501.05012
DOI: 10.1007/3-540-59408-6_69
published in: Integer Programming and Combinatorial Optimization
publication date: 2022-08-30T00:00:00Z
full work available at URL: https://ir.cwi.nl/pub/1414
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 7577909
zbMATH Keywords: combinatorial polynomial algorithm
MaRDI profile type: Publication
OpenAlex ID: W1548208024
cites work: Augmentation Problems
cites work: Augmenting Graphs to Meet Edge-Connectivity Requirements
cites work: Minimal edge-coverings of pairs of sets
cites work: On the optimal vertex-connectivity augmentation
cites work: Q4234133
cites work: Edge-connectivity augmentation problems
cites work: A minimum 3-connectivity augmentation of a graph
Recommended article: Making bidirected graphs strongly connected
Recommended article: How to make a graph four-connected
Recommended article: Strong subgraph connectivity of digraphs
Recommended article: (Strong) proper vertex connection of some digraphs
Recommended article: (Strong) total proper connection of some digraphs
Recommended article: Making a dominating set of a graph connected
Recommended article: Q3487368
Recommended article: Q3480079
Recommended article: Making the components of a graph \(k\)-connected
Recommended article: Q4215936
description: scientific article; zbMATH DE number 7577909