Skip to main content
SpringerLink
Log in

Minimalen-fach kantenzusammenhängende Graphen

  • Published:
Mathematische Annalen Aims and scope Submit manuscript

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

Literatur

  1. Halin, R.: A theorem onn-connected graphs. J. Combinatorial Theory7, 150–154 (1969).

    Google Scholar 

  2. Lick, D.: Critically and minimallyn-connected graphs. In “The many facets of graph theory” Lectures Notes 110, S. 199–205. Berlin-Heidelberg-New York: Springer 1969.

    Google Scholar 

  3. Mader, W.: Minimalen-fach zusammenhängende Graphen mit maximaler Kantenzahl. Erscheint im J. Reine Angewandte Mathematik.

  4. -- Existenzn-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte. Erscheint in den Abh. math. Sem. Univ. Hamburg.

  5. —— über den Zusammenhang symmetrischer Graphen. Arch. Math.21, 331–336 (1970).

    Google Scholar 

  6. Watkins, M. E.: Connectivity of transitive graphs. J. Combinatorial Theory8, 23–29 (1970).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. II. Mathematisches Institut, Königin-Luise-Str. 24-26, BRD-1000, Berlin 33, Deutschland

    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. Minimalen-fach kantenzusammenhängende Graphen. Math. Ann. 191, 21–28 (1971). https://doi.org/10.1007/BF01433466

Download citation

  • Received:

  • Issue Date:

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

Search

Navigation