Skip to main content
SpringerLink
Log in

How to make a graph four-connected

  • Published:
Mathematical Programming Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Mathematical Institute of the Hungarian Academy of Sciences, Reáltanoda u. 13-15, H-1053 Budapest, Hungary, HU

    Ervin Győri

  2. CWI, Kruislaan 413, 1098 SJ, Amsterdam, The Netherlands. Current address: BRICS, Department of Computer Science, University of Aarhus, DK-8000 Aarhus C, Denmark, NL

    Tibor Jordán

Authors
  1. Ervin Győri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tibor Jordán
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received October 1995 / Revised version received March 1997 Published online March 16, 1999

Rights and permissions

Reprints 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

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s101070050039

Search

Navigation