Title of article
Accessibility and Ends of Graphs
Author/Authors
Mِller، نويسنده , , Rِgnvaldur G.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1996
Pages
7
From page
303
To page
309
Abstract
We prove that a locally finite inaccessible graph with a transitive automorphism group always has uncountably many thick ends. Combined with a result of Thomassen and Woess this shows that a connected locally finite transitive graph is inaccessible if and only if it has uncountably many thick ends.
Journal title
Journal of Combinatorial Theory Series B
Serial Year
1996
Journal title
Journal of Combinatorial Theory Series B
Record number
1526106
Link To Document