Transforming spanning trees: A lower bound
type: Item
instance of: scholarly article
title: Transforming spanning trees: A lower bound
zbMATH Open document ID: 1169.05314
author: Kevin Buchin
author: Andreas Razen
author: Takeaki Uno
author: Uli Wagner
published in: Computational Geometry
publication date: 2009-06-30T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 5572053
zbMATH Keywords: crossing-free geometric graphs
zbMATH Keywords: compatible spanning trees
zbMATH Keywords: transformation graphs
MaRDI profile type: Publication
full work available at URL: j.comgeo.2008.03.005
OpenAlex ID: W2147388254
cites work: Transforming spanning trees and pseudo-triangulations
cites work: Sequences of spanning trees and a fixed tree theorem
cites work: Compatible Geometric Matchings
cites work: A quadratic distance bound on sliding between crossing-free spanning trees
cites work: Reverse search for enumeration
cites work: Lower bounds on the number of crossing-free subgraphs of \(K_N\)
cites work: Geometric tree graphs of points in convex position
cites work: Graphs of non-crossing perfect matchings
cites work: Graphs of triangulations and perfect matchings
DOI: 10.1016/J.COMGEO.2008.03.005
Recommended article: Transforming spanning trees and pseudo-triangulations
Recommended article: Spanning tree with lower bound on the degrees
Recommended article: Lower-Stretch Spanning Trees
Recommended article: Lower-stretch spanning trees
Recommended article: Lower bounds on treespan
Recommended article: Lower and upper bounds for the spanning tree with minimum branch vertices
Recommended article: Q5461426
Recommended article: Lower bounds on the number of leaves in spanning trees
Recommended article: On the combinatorial lower bound for the extension complexity of the spanning tree polytope
Recommended article: Q6059174
description: scientific article; zbMATH DE number 5572053