Title of article :
Accessibility and Ends of Graphs
Author/Authors :
Mِller، نويسنده , , Rِgnvaldur G.، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1996
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
Journal title :
Journal of Combinatorial Theory Series B