Skip to main content
SpringerLink
Log in

On some connectivity properties of Eulerian graphs

  • Published:
Acta Mathematica Academiae Scientiarum Hungarica 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

References

  1. T. Gallai, Maximum-Minimumsätze und verallgemeinerte Faktoren von Graphen,Acta Math. Acad. Sci. Hungar. 12 (1961), 131–173.

    Google Scholar 

  2. A. Kotzig,Suvilost a pravidelná suvilost konecnych grafov, D. Sc. Thesis, Karlova Universita Praha, VSE (Bratislava, 1956).

    Google Scholar 

  3. A. Kotzig, Vertex splittings preserving the maximal edge-connectedness of 4-regular multigraphs,J. Comb. Theory (to appear).

  4. B. Rothschild andA. Whinston, Feasibility of two commodity network flows,Operations Research,14 (1966), 1121–1129.

    Google Scholar 

  5. G. J. Simmons, Command graphs,Infinite and Finite Sets, Coll. Math. Soc. J. Bolyai10 (Bolyai-North-Holland, 1975), 1277–1349.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Bolyai Institute, József Attila University, Szeged, Hungary

    L. Lovász

Authors
  1. L. Lovász
    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

Lovász, L. On some connectivity properties of Eulerian graphs. Acta Mathematica Academiae Scientiarum Hungaricae 28, 129–138 (1976). https://doi.org/10.1007/BF01902503

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation