Edge-ends in countable graphs (Q1362094)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Edge-ends in countable graphs |
scientific article; zbMATH DE number 1042496
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Edge-ends in countable graphs |
scientific article; zbMATH DE number 1042496 |
Statements
Edge-ends in countable graphs (English)
0 references
12 August 1997
0 references
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.
0 references
edge-end
0 references
edge-end-faithful spanning trees
0 references
tree
0 references
0.8610158562660217
0 references
0.8195382952690125
0 references
0.8113663792610168
0 references
