Skip to main content
Springer Nature Link
Log in

A homology theory for spanning tress of a graph

  • 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

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

References

  1. P. S. Alexandroff-H. Hopf,Topologie, Springer (Berlin, 1935).

    Google Scholar 

  2. A. Frank,Combinatorial algorithms, algorithmic proofs. Doctoral dissertation (Budapest, 1975) (in Hungarian).

  3. E. Győry, On division of graphs to connected subgraphs; to appear in theProceedings of the Fifth Hungarian Combinatorial Colloquium (Budapest, 1977).

Download references

Author information

Authors and Affiliations

  1. Bolyai Institute, József Attila University, Aradi Vértanúk Tere 1, 6720, Szeged, Hungary

    L. Lovasz

Authors
  1. L. Lovasz
    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

Lovasz, L. A homology theory for spanning tress of a graph. Acta Mathematica Academiae Scientiarum Hungaricae 30, 241–251 (1977). https://doi.org/10.1007/BF01896190

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation