Skip to main content
SpringerLink
Log in

The structure of rayless graphs

  • Published:
Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg 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. Andreae andR. Schmidt, On the reconstruction of rayless infinite forests.J. Graph Theory 8 (1984), 405–422.

    Article  MATH  MathSciNet  Google Scholar 

  2. R. Diestel,Graph decompositions. A study in infinite graph theory. Clarendon Press, 1990.

  3. —, On spanning trees and k-connectedness in infinité graphs.J. Combin. Theory Ser.B56 (1992), 263–277.

    Article  MATH  MathSciNet  Google Scholar 

  4. R. Halin, Charakterisierung der Graphen ohne unendliche Wege.Arch. Math. 16 (1965), 227–231.

    Article  MATH  MathSciNet  Google Scholar 

  5. —, Graphen ohne unendliche Wege.Math. Nachr. 31 (1966), 111–123.

    Article  MATH  MathSciNet  Google Scholar 

  6. -, Fixed configurations in graphs with small number of disjoint rays.Contemporary methods in graph theory (R. Bodendiek ed.), Wissenschaftsverlag Mannheim 1990,639–649.

  7. —, Minimization problems for infinite n-connected graphs.Combinatorics, Probability, and Computing 2 (1993), 417–436.

    Article  MATH  MathSciNet  Google Scholar 

  8. —, A note on k-connected rayless graphs.J. Combin. Theory Ser. B72 (1998), 257–2260.

    Article  MATH  MathSciNet  Google Scholar 

  9. N. Polat, Sur un problème de Erdös: Une extension du théorème de Menger aux graphes infinis.Preprint Université de Provence, Aix-en-Provence, 1980.

  10. N. Polat andG. Sabidussi, Fixed elements of infinite trees.Discrete Math. 130 (1994), 97–102.

    Article  MATH  MathSciNet  Google Scholar 

  11. N. Robertson, P. Seymour andR. Thomas, Excluding infinite minors.Discrete Math. 95 (1991), 303–319.

    Article  MATH  MathSciNet  Google Scholar 

  12. R. Schmidt,Ein Reduktionsverfahren für Weg-endliche Graphen, Diss. Hamburg 1982.

  13. —, Ein Ordnungsbegriff für Graphen ohne unendliche Wege mit Anwendung auf n-fach zusammenhängende Graphen.Arch. Math. 40 (1983), 283–288.

    Article  MATH  Google Scholar 

  14. —, Almost reconstructing infinite, rayless graphs.J. Graph Theory 9 (1985), 205–211.

    Article  MATH  MathSciNet  Google Scholar 

  15. —, Nearly reconstructing infinite rayless graphs.Congressus Numerantium 40 (1983)319–337.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematisches Seminar, Universität Hamburg, Bundesstr. 55, D-20146, Hamburg, Germany

    R. Halin

Authors
  1. R. Halin
    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

Halin, R. The structure of rayless graphs. Abh.Math.Semin.Univ.Hambg. 68, 225–253 (1998). https://doi.org/10.1007/BF02942564

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation