Skip to main content
SpringerLink
Log in

On a property ofn-edge-connected digraphs

  • Published:
Combinatorica Aims and scope Submit manuscript

Abstract

It is proved that for every pair of verticesx, y in a finiten-edge-connected digraphD there is such a pathP fromx toy that the digraphD′ arising fromD by deleting the edges ofP is (n−1)-edge-connected.

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. W. Mader, Ecken vom Innen- und Außengradn in minimaln-fach kantenzusammenhängenden Digraphen,Arch. Math. 25 (1974), 107–112.

    Article  MATH  MathSciNet  Google Scholar 

  2. W. Mader, Konstruktion allern-fach kantenzusammenhängenden Digraphen, to appear inEuropean Journal of Combinatorics.

  3. Y, Shiloach, Edge-disjoint branching in directed multigraphs,Inform. Process. Lett 8 (1979), 24–27.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Mathematik Universität Hannover, Welfengarten 1, D-3000, Hannover 1, Germany

    W. Mader

Authors
  1. W. Mader
    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

Mader, W. On a property ofn-edge-connected digraphs. Combinatorica 1, 385–386 (1981). https://doi.org/10.1007/BF02579461

Download citation

  • Received:

  • Issue Date:

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

AMS subject classification (1980)

Search

Navigation