Blockers for Noncrossing Spanning Trees in Complete Geometric Graphs

DOI10.1007/978-1-4614-0110-0_20zbMath1272.05026arXiv1201.4782OpenAlexW1969594396MaRDI QIDQ2847917

Micha A. Perles, Eduardo Rivera-Campo, Chaya Keller, Virginia Urrutia-Galicia

Publication date: 25 September 2013

Published in: Thirty Essays on Geometric Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1201.4782

zbMATH Keywords

blockerconvex geometric graphsblocking all simple spanning subgraphscomplete geometric graphsimple spanning trees

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (3)

Packing plane spanning trees and paths in complete geometric graphs ⋮ Blockers for triangulations of a convex polygon and a geometric maker-breaker game ⋮ Plane Spanning Trees in Edge-Colored Simple Drawings of $$K_{n}$$

This page was built for publication: Blockers for Noncrossing Spanning Trees in Complete Geometric Graphs