Edge-ends in countable graphs

From MaRDI portal





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 ones.











This page was built for publication: Edge-ends in countable graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362094)