Blockers for Noncrossing Spanning Trees in Complete Geometric Graphs
From MaRDI portal
Publication:2847917
DOI10.1007/978-1-4614-0110-0_20zbMath1272.05026arXiv1201.4782MaRDI 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
blocker; convex geometric graphs; blocking all simple spanning subgraphs; complete geometric graph; simple spanning trees
05C05: Trees
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
05C62: Graph representations (geometric and intersection representations, etc.)
Related Items
Plane Spanning Trees in Edge-Colored Simple Drawings of $$K_{n}$$, Blockers for triangulations of a convex polygon and a geometric maker-breaker game, Packing plane spanning trees and paths in complete geometric graphs