Repositorio de producción científica de la Universidad de Sevilla

Geometric tree graphs of points in convex position

 

Advanced Search
 
Opened Access Geometric tree graphs of points in convex position
Cites

Show item statistics
Icon
Export to
Author: Hernando, María del Carmen
Hurtado, Ferrán
Márquez Pérez, Alberto
Mora, Mercé
Noy, Marc
Department: Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Date: 1999
Published in: Discrete Applied Mathematics, 93 (1), 51-66.
Document type: Article
Abstract: Given a set P of points in the plane, the geometric tree graph of P is defined as the graph T(P) whose vertices are non-crossing spanning with straight edges trees of P, and where two trees T1 and T2 are adjacent if T2 = T1 − e + f for some edges e and f. In this paper we concentrate on the geometric tree graph of a set of n points in convex position, denoted by Gn. We prove several results about Gn, among them the existence of Hamiltonian cycles and the fact that they have maximum connectivity.
Size: 865.7Kb
Format: PDF

URI: http://hdl.handle.net/11441/33840

DOI: http://dx.doi.org/ doi:10.1016/S0166-218X(99)00006-2

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)