Skip to main content
SpringerLink
Log in

Every 4k-edge-connected graph is Weakly 3k-linked

  • Original Papers
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

We prove:

  1. (i)

    Fork ≥ 2 andα = 0, 1, every (4k + 2α)-edge-connected graph is weakly (3k + 2α)-linked.

  2. (ii)

    IfG is ak-edge-connected graph (k ≥ 2),s, t are vertices andf is an edge, then there exists a pathP betweens andt such thatf ∉ E(P) andG − E(P) − f is (k − 2)-edge-connected, whereE(P) denotes the edge set ofP.

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

References

  1. Hirata, T., Kubota, K., Saito, O.: A sufficient condition for a graph to be weaklyk-linked. J. Comb. Theory (B)36, 85–94 (1984)

    Google Scholar 

  2. Mader, W.: A reduction method for edge-connectivity in graphs. Ann. Discrete Math.3, 145–164 (1978)

    Google Scholar 

  3. Mader, W.: Paths in graphs, reducing the edge-connectivity only by two. Graphs and Combinatorics1, 81–89 (1985)

    Google Scholar 

  4. Okamura, H.: Multicommodity flows in graphs II. Japan. J. Math.10, 99–116 (1984)

    Google Scholar 

  5. Okamura, H.: Paths and edge-connectivity in graphs. J. Comb. Theory (B)37, 151–172 (1984)

    Google Scholar 

  6. Okamura, H.: Paths and edge-connectivity in graphs II. In: Number theory and Combinatorics (Tokyo, Okayama, Kyoto 1984), pp. 337–352. Singapore: World Sci. Publishing 1985

    Google Scholar 

  7. Okamura, H.: Paths and edge-connectivity in graphs III. Six-terminalk paths. Graphs and Combinatorics3, 159–189 (1987)

    Google Scholar 

  8. Okamura, H.: Paths ink-edge-connected graphs. J. Comb. Theory (B)45, 345–355 (1988)

    Google Scholar 

  9. Thomassen, C.: 2-linked graphs. European J. Comb.1, 371–378 (1980)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Engineering, Osaka City University, 558, Osaka, Japan

    Haruko Okamura

Authors
  1. Haruko Okamura
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Okamura, H. Every 4k-edge-connected graph is Weakly 3k-linked. Graphs and Combinatorics 6, 179–185 (1990). https://doi.org/10.1007/BF01787729

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Search

Navigation