Login / Signup
A Cantor-Bernstein-type theorem for spanning trees in infinite graphs.
Joshua Erde
J. Pascal Gollin
Attila Joó
Paul Knappe
Max Pitz
Published in:
J. Comb. Theory, Ser. B (2021)
Keyphrases
</>
spanning tree
minimum spanning trees
minimum spanning tree
edge disjoint
undirected graph
minimum cost
minimum weight
weighted graph
root node
edge weights
lowest cost
von neumann
depth first search
multimedia
graph theory
bipartite graph
optimization problems
special case