Simplicial Decompositions of Infinite Graphs
From MaRDI portal
Publication:4163565
DOI10.1016/S0167-5060(08)70500-4zbMath0383.05034MaRDI QIDQ4163565
Publication date: 1978
Published in: Advances in Graph Theory (Search for Journal in Brave)
Related Items
Quickly proving Diestel's normal spanning tree criterion, A simple existence criterion for normal spanning trees, Topological cycle matroids of infinite graphs, On end-faithful spanning trees in infinite graphs, Characterising \(k\)-connected sets in infinite graphs, Duality theorems for stars and combs I: Arbitrary stars and combs, Duality theorems for stars and combs II: Dominating stars and dominated combs, Excluding a full grid minor, 2-linked graphs, A unified existence theorem for normal spanning trees, An End-Faithful Spanning Tree Counterexample, A proof of the bounded graph conjecture, Normal Tree Orders for Infinite Graphs, Unnamed Item, Ubiquity and the Farey graph, On graphs with a metric end space