Topological complexity of graphs and their spanning trees

DOI10.1007/BF01874350zbMATH Open0837.05046MaRDI QIDQ1804745FDOQ1804745

Authors: Ronny Nahum, Samy Zafrany 

Publication date: 1 January 1996

Published in: Acta Mathematica Hungarica (Search for Journal in Brave)

Recommendations

• Minimal spanning trees
• Minimal spanning trees on infinite sets
• Spanning tree of a multiple graph
• End spaces and spanning trees

zbMATH Keywords

spanning treesweighted graphtopological complexitycomponentsperfect Polish space

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• Title not available (Why is that?)
• Separation principles in the hierarchies of classical and effective descriptive set theory
• Title not available (Why is that?)
• Infinite matching theory
• The cover-index of infinite graphs

Cited In (3)

• Fixed topology Steiner trees and spanning forests
• Treetopes and their Graphs
• Topological complexity of configuration spaces of fully articulated graphs and banana graphs

This page was built for publication: Topological complexity of graphs and their spanning trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1804745)