Title of article
Edge-Ends in Countable Graphs
Author/Authors
Hahn، نويسنده , , Ge?a and Laviolette، نويسنده , , François and ?ir??، نويسنده , , Jozef، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1997
Pages
20
From page
225
To page
244
Abstract
We introduce the notion of an edge-end and characterize those countable graphs which have edge-end-faithful spanning trees. We also prove that for a natural class of graphs, there always exists a tree which is faithful on the undominated ends and rayless over the dominated does.
Journal title
Journal of Combinatorial Theory Series B
Serial Year
1997
Journal title
Journal of Combinatorial Theory Series B
Record number
1526257
Link To Document