On automorphisms of infinite graphs with forbidden subgraphs

Norbert Seifter

Research output: Contribution to journalArticleResearchpeer-review

1 Citation (Scopus)

Abstract

LexX be anm-connected infinite graph without subgraphs homeomorphic toKm, n, for somen, and let α be an automorphism ofX with at least one cycle of infinite length. We characterize the structure of α and use this characterization to extend a known result about orientation-preserving automorphisms of finite plane graphs to infinite plane graphs. In the last section we investigate the action of α on the ends ofX and show that α fixes at most two ends (Theorem 3.2).
Original languageEnglish
Pages (from-to)351-356
Number of pages6
JournalCombinatorica
Volume4.1984
DOIs
Publication statusPublished - Dec 1984

Cite this