Published June 7, 2017 | Version v1
Publication Metadata-only

On 4-connected geometric graphs

Creators

Contributors

Description

Given a set S of n points in the plane, in this paper we give a necessary and sometimes sufficient condition to build a 4-connected non-crossing geometric graph on S.

Abstract

Gobierno de Aragón

Abstract

Ministerio de Economía y Competitividad

Abstract

European Science Foundation

Abstract

Ministerio de Ciencia e Innovación

Additional details

Identifiers

URL
https://idus.us.es/handle/11441/61089
URN
urn:oai:idus.us.es:11441/61089

Origin repository

Origin repository
USE