scientific article
From MaRDI portal
zbMath1250.05060MaRDI QIDQ3575470
David R. Wood, Clemens Huemer, Oswin Aichholzer, Ferran Hurtado, Sergio Cabello, Ruy Fabila-Monroy, David Flores-Peñaloza, Thomas Hackl
Publication date: 27 July 2010
Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/985/0.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
An optimal algorithm for plane matchings in multipartite geometric graphs, Packing plane spanning trees and paths in complete geometric graphs, An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs, Restricted triangulation on circulant graphs, Discrete geometry on colored point sets in the plane -- a survey, Faster bottleneck non-crossing matchings of points in convex position, Near equipartitions of colored point sets, Triangulability of convex graphs and convex skewness, Long non-crossing configurations in the plane, The hamburger theorem, Convex equipartitions of colored point sets, Non-crossing monotone paths and binary trees in edge-ordered complete geometric graphs, On convex geometric graphs with no \(k+1\) pairwise disjoint edges, Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon
