Skip to main content
SpringerLink
Log in

Topological complexity of graphs and their spanning trees

  • Published:
Acta Mathematica 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. W. J. Addison, Separation principles in the hierarchies of classical and effective descriptive set theory,Fund. Math.,46 (1959), 123–135.

    Google Scholar 

  2. R. Aharoni, Infinite matching theory,Discrete Math.,95 (1991), 5–22.

    Google Scholar 

  3. L. D. Andersen and C. Thomassen, The cover-index of infinite graphs,Aequationes Math.,20 (1980), 244–251.

    Google Scholar 

  4. M. Kondo, Sur, l'uniformization de complementaires analytiques et les ensembles projectifs de la second classe,Jap. J. Math.,15 (1938), 197–230.

    Google Scholar 

  5. K. Kuratowski,Topology I, translated from French by J. Jaborowski, Academic Press (New York-London-Warszawa, 1966).

    Google Scholar 

  6. J. B. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem,Proc. Amer. Math. Soc.,7 (1956), 48–50.

    Google Scholar 

  7. Nikolai N. Luzin,Leçons sur les Ensembles Analytiques et Leurs Applications, Gauthier-Villars (Paris, 1930).

    Google Scholar 

  8. Y. N. Moschovakis,Descriptive Set Theory, North-Holland (Amsterdam-New York-Oxford, 1980).

    Google Scholar 

  9. C. Thomassen,Infinite Graphs, Topics in Graph Theory 2, Academic Press inc., 1983 (London Ltd.).

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and computer science, Haifa University, 31905, Haifa, Israel

    R. Nahum & S. Zafrany

  2. Department of Mathematics, Technion City, 32000, Haifa, Israel

    R. Nahum & S. Zafrany

Authors
  1. R. Nahum
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Zafrany
    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

Nahum, R., Zafrany, S. Topological complexity of graphs and their spanning trees. Acta Math Hung 66, 1–10 (1995). https://doi.org/10.1007/BF01874350

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation