Countably determined ends and graphs
From MaRDI portal
Publication:2673479
DOI10.1016/j.jctb.2022.04.002zbMath1490.05190arXiv2101.07247OpenAlexW3123609421MaRDI QIDQ2673479
Publication date: 10 June 2022
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2101.07247
infinite graphtree-decompositioncountably determinednormal treeaxioms of countabilityfirst countable end spacesecond countable end space
Topological characterizations of particular spaces (54F65) Base properties of topological spaces (54D70) Infinite graphs (05C63)
Related Items
Cites Work
- Unnamed Item
- End spaces and spanning trees
- End spaces of graphs are normal
- Graph-theoretical versus topological ends of graphs.
- Ends and tangles
- Ends and multi-endings. I
- Ends and multi-endings. II
- Approximating infinite graphs by normal trees
- Tangles and the Stone-Čech compactification of infinite graphs
- Über unendliche Wege in Graphen
- Canonical trees of tree-decompositions
- Ends, tangles and critical vertex sets
- Wurzelbäume und unendliche Wege in Graphen
- Duality theorems for stars and combs I: Arbitrary stars and combs