Abstract
(i) every 2-connected graph on n vertices can be made 4-connected by adding at most n new edges, and
(ii) every 3-connected and 3-regular graph on n≥8 vertices can be made 4-connected by adding n/2 new edges.
Article PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received October 1995 / Revised version received March 1997 Published online March 16, 1999
Rights and permissions
About this article
Cite this article
Győri, E., Jordán, T. How to make a graph four-connected. Math. Program. 84, 555–563 (1999). https://doi.org/10.1007/s101070050039
Published:
Issue Date:
DOI: https://doi.org/10.1007/s101070050039