On triconnected and cubic plane graphs on given point sets

Authors:
Alfredo García;Ferran Hurtado;Clemens Huemer;Javier Tejel;Pavel Valtr
Affiliations:
Departamento de Métodos Estadísticos, Facultad de Ciencias, Universidad de Zaragoza, Pedro Cerbuna, 12, 50009 Zaragoza, Spain;Dept. Matemàtica Aplicada II, Universitat Politècnica de Catalunya, Jordi Girona 1-3, 08034 Barcelona, Spain;Dept. Matemàtica Aplicada IV, Universitat Politècnica de Catalunya, Avinguda del Canal Olímpic 15, 08860 Castelldefels, Spain;Departamento de Métodos Estadísticos, Facultad de Ciencias, Universidad de Zaragoza, Pedro Cerbuna, 12, 50009 Zaragoza, Spain;Department of Applied Mathematics and Institute for Theoretical Computer Science (ITI), Charles University, Malostranské nám. 25, 118 00 Praha 1, Czech Republic
Venue:
Computational Geometry: Theory and Applications
Year:
2009

On collinear sets in straight-line drawings

WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Approximating the edge length of 2-edge connected planar geometric graphs on a set of points

LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Cubic plane graphs on a given point set

Proceedings of the twenty-eighth annual symposium on Computational geometry

Hi-index	0.00

Let S be a set of n=4 points in general position in the plane, and let h=4 is even and h=