Compatible spanning trees

DOI10.1016/j.comgeo.2013.12.009zbMath1295.05088OpenAlexW2062440435MaRDI QIDQ2444309

Clemens Huemer, Alfredo Daniel Garcia, Ferran Hurtado, F. Javier Tejel

Publication date: 9 April 2014

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2013.12.009

zbMATH Keywords

geometric graphcompatible treescompatible graphsgeometric spanning tree

Mathematics Subject Classification ID

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

Related Items (5)

Plane augmentation of plane graphs to meet parity constraints ⋮ The Mathematics of Ferran Hurtado: A Brief Survey ⋮ Transition operations over plane trees ⋮ Flip distance to some plane configurations ⋮ Flip Distance to some Plane Configurations.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing simple circuits from a set of line segments
• Augmenting the edge connectivity of planar straight line graphs to three
• Connectivity augmentation in planar straight line graphs
• Pointed binary encompassing trees: simple and optimal
• Augmenting the connectivity of outerplanar graphs
• On simultaneous planar graph embeddings
• Compatible geometric matchings
• Point-set embeddings of trees with given partial drawings
• Augmenting the connectivity of geometric graphs
• Planar packing of trees and spider trees
• Hamiltonian triangulations and circumscribing polygons of disjoint line segments
• On a counterexample to a conjecture of Mirzaian
• Straight-line embeddings of two rooted trees in the plane
• The rooted tree embedding problem into points in the plane
• On circumscribing polygons for line segments
• Segment endpoint visibility graphs are Hamiltonian
• Disjoint compatible geometric matchings
• Encompassing colored planar straight line graphs
• Graphs of triangulations and perfect matchings
• Plane Geometric Graph Augmentation: A Generic Perspective
• Computing Simple Circuits from a Set of Line Segments is NP-Complete
• Growing a Tree from Its Branches
• Augmenting the Connectivity of Planar and Geometric Graphs
• Every set of disjoint line segments admits a binary tree
• Sequences of spanning trees and a fixed tree theorem

This page was built for publication: Compatible spanning trees