Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Topological complexity of graphs and their spanning trees

From MaRDI portal
Publication:1804745
Jump to:navigation, search

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1804745&oldid=14164361"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 09:13.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki