A sufficient condition for the existence of plane spanning trees on geometric graphs
From MaRDI portal
Publication:714896
DOI10.1016/j.comgeo.2012.02.006zbMath1251.05040arXiv1202.3385OpenAlexW3123702182MaRDI QIDQ714896
Eduardo Rivera-Campo, Virginia Urrutia-Galicia
Publication date: 12 October 2012
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1202.3385
Related Items
Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs, Plane Spanning Trees in Edge-Colored Simple Drawings of $$K_{n}$$