Accessibility and ends of graphs

DOI10.1006/jctb.1996.0023zbMath0857.05043OpenAlexW2091606891MaRDI QIDQ1924129

Rögnvaldur G. Möller

Publication date: 14 October 1996

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1996.0023

zbMATH Keywords

automorphism grouptransitive graphinaccessible graphstructured treesthick ends

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items

A Stallings type theorem for quasi-transitive graphs ⋮ Analogues of Cayley graphs for topological groups ⋮ The classification of connected-homogeneous digraphs with more than one end ⋮ Transitivity conditions in infinite graphs