Spanning trees of countable graphs omitting sets of dominated ends
From MaRDI portal
Publication:1297479
DOI10.1016/S0012-365X(98)00042-9zbMath0935.05034MaRDI QIDQ1297479
Norbert Polat, François Laviolette
Publication date: 9 August 1999
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (3)
Edge-ends in countable graphs ⋮ Decompositions of infinite graphs. II: Circuit decompositions ⋮ Multi-Faithful Spanning Trees of Infinite Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An end-faithful spanning tree counterexample
- End-faithful forests and spanning trees in infinite graphs
- Infinite connected graphs with no end-preserving spanning trees
- The end structure of a graph: Recent results and open problems
- Aspects topologiques de la séparation dans les graphes infinis. I. II
- Über unendliche Wege in Graphen
- Über die Enden diskreter Räume und Gruppen
- Développements terminaux des graphes infinis I. Arbres maximaux coterminaux
- Développements terminaux des graphes infinis II. Degré de développement terminal
- Développments terminaux des graphes infinis III. Arbres maximaux sans rayon, cardinalité maximum des ensembles disjoints de rayons
This page was built for publication: Spanning trees of countable graphs omitting sets of dominated ends
