Topological complexity of graphs and their spanning trees

DOI10.1007/BF01874350zbMath0837.05046MaRDI QIDQ1804745

R. Nahum, Samy Zafrany

Publication date: 1 January 1996

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

zbMATH Keywords

weighted graphcomponentstopological complexityspanning treesperfect Polish space

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• The cover-index of infinite graphs
• Infinite matching theory
• Separation principles in the hierarchies of classical and effective descriptive set theory

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