Packing plane spanning trees into a point set
From MaRDI portal
Publication:2206739
DOI10.1016/j.comgeo.2020.101653zbMath1450.05067arXiv1803.02385MaRDI QIDQ2206739
Ahmad Biniaz, Alfredo Daniel Garcia
Publication date: 23 October 2020
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.02385
05C05: Trees
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Plane Spanning Trees in Edge-Colored Simple Drawings of $$K_{n}$$, Coloring drawings of graphs, On asymptotic packing of geometric graphs, On crossing-families in planar point sets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The book thickness of a graph
- Crossing families
- Computing a centerpoint of a finite planar set of points in linear time
- Bounds of the number of disjoint spanning trees
- Partitions of complete geometric graphs into plane trees
- Packing plane spanning trees and paths in complete geometric graphs
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- The dimension of intersections of convex sets