Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/2117/15075
Título: | Compatible matchings in geometric graphs |
---|---|
Autor/a: | Aichholzer, Oswin; García Olaverri, Alfredo; Hurtado Díaz, Fernando Alfredo; Tejel Altarriba, F. Javier |
Otros autores: | Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada II; Universitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta |
Abstract: | Two non-crossing geometric graphs on the same set of points are compatible if their union is also non-crossing. In this paper, we prove that every graph G that has an outerplanar embedding admits a non-crossing perfect matching compatible with G. Moreover, for non-crossing geometric trees and simple polygons, we study bounds on the minimum number of edges that a compatible non-crossing perfect matching must share with the tree or the polygon. We also give bounds on the maximal size of a compatible matching (not necessarily perfect) that is disjoint from the tree or the polygon. |
Materia(s): | -Graph theory -Grafs, Teoria de -Classificació AMS::05 Combinatorics::05C Graph theory |
Derechos: | Attribution-NonCommercial-NoDerivs 3.0 Spain
http://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
Tipo de documento: | Artículo - Versión publicada Objeto de conferencia |
Editor: | Centre de Recerca Matemàtica |
Compartir: |