Ends of graphs

Rögnvaldur G. Möller*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

27 Citations (Scopus)


It is shown how questions about ends of locally finite graphs can be reduced to questions about trees. Several applications are given; for example, locally finite connected graphs with infinitely many ends and automorphism groups that act transitively on the ends are classified.

Original languageEnglish
Pages (from-to)255-266
Number of pages12
JournalMathematical Proceedings of the Cambridge Philosophical Society
Issue number2
Publication statusPublished - Mar 1992


Dive into the research topics of 'Ends of graphs'. Together they form a unique fingerprint.

Cite this