Edge-Ends in Countable Graphs |
| |
| Authors: | Geňa Hahn,Franç ois Laviolette,Jozef &Scaron irá ň |
| |
| Affiliation: | aDépartement d'Informatique, Université de Montréal, Montréal, Quebec, Canada;bDépartement de Mathématiques et de Statistique, Université de Montréal, Montréal, Quebec, Canada;cSlovak Technical University, Bratislava, Slovakia |
| |
| 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. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
