A note on the vertex-connectivity augmentation problem
From MaRDI portal
Publication:1386437
DOI10.1006/jctb.1997.1786zbMath0940.05040MaRDI QIDQ1386437
Publication date: 19 July 2000
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/227035e20120f1ec2f377e2d4f80ce544631adeb
05C35: Extremal problems in graph theory
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
05C40: Connectivity
Related Items
Graph connectivity and its augmentation: Applications of MA orderings, On shredders and vertex connectivity augmentation, Independence free graphs and vertex connectivity augmentation, Multigraph augmentation under biconnectivity and general edge-connectivity requirements, Unnamed Item
Cites Work