scientific article; zbMATH DE number 1303567

MaRDI QIDQ4250193zbMATH OpenFDO

Authors Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki

Publication date 17 June 1999

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Optimal augmentation of a 2-vertex-connected multigraph to an -edge-connected and 3-vertex-connected multigraph
• Augmenting a \((k-1)\)-vertex-connected multigraph to an \(\ell\)-edge-connected and \(k\)-vertex-connected multigraph
• scientific article; zbMATH DE number 1303025
• scientific article; zbMATH DE number 2080257

Cited in

(11)

• How to make a graph four-connected
• Polyhedral structure of submodular and posi-modular systems
• Optimal augmentation of a 2-vertex-connected multigraph to an -edge-connected and 3-vertex-connected multigraph
• scientific article; zbMATH DE number 1617267 (Why is no real title available?)
• scientific article; zbMATH DE number 4128844 (Why is no real title available?)
• Edge-Connectivity Augmentation Preserving Simplicity
• scientific article; zbMATH DE number 1263261 (Why is no real title available?)
• scientific article; zbMATH DE number 1303025 (Why is no real title available?)
• scientific article; zbMATH DE number 2080257 (Why is no real title available?)
• scientific article; zbMATH DE number 1405799 (Why is no real title available?)
• Graph connectivity and its augmentation: Applications of MA orderings

This page was built for publication:

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