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.
Recommendations
Cites work
- An end-faithful spanning tree counterexample
- Développments terminaux des graphes infinis III. Arbres maximaux sans rayon, cardinalité maximum des ensembles disjoints de rayons
- End-faithful forests and spanning trees in infinite graphs
- scientific article; zbMATH DE number 4156464 (Why is no real title available?)
- Infinite connected graphs with no end-preserving spanning trees
- Spanning trees of countable graphs omitting sets of dominated ends
- The end structure of a graph: Recent results and open problems
- Über unendliche Wege in Graphen
Cited in
(11)- Spanning trees of countable graphs omitting sets of dominated ends
- Graph-theoretical versus topological ends of graphs.
- Locally finite graphs with ends: A topological approach. I: Basic theory
- Decompositions of infinite graphs. II: Circuit decompositions
- Countably determined ends and graphs
- End-Faithful Spanning Trees of Countable Graphs with Prescribed Sets of Rays
- Duality of ends
- scientific article; zbMATH DE number 887763 (Why is no real title available?)
- Connectoids. I: A universal end space theory
- Edge-connectivity between edge-ends of infinite graphs
- A metrization theorem for edge-end spaces of infinite graphs
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)