Given a plane geometric graph G on n vertices, we want to augment it so that given parity
constraints of the vertex degrees are met. In other words, given a subset R of the vertices, we …

En 2017 el IUMA ha contado con 77 profesores permanentes, pertenecientes a 11 Grupos
de investigación reconocidos por el Gobierno de Aragón, 11 miembros no permanentes, y 8 …

We study biplane graphs drawn on a finite planar point set SS in general position. This is the
family of geometric graphs whose vertex set is SS and can be decomposed into two plane …

For a set of geometric objects, the associative geometric intersection graph is the graph with
a vertex for each object and an edge between two vertices if and only if the corresponding …

Abstract Let G=(V, E) be an edge weighted geometric graph (not necessarily planar) such
that every edge is horizontal or vertical. The weight of an edge uv∈ E is the L 1-distance …

A plane topological graph G=(V, E) is a graph drawn in the plane whose vertices are points
in the plane and whose edges are simple curves that do not intersect, except at their …

The Mathematics of Ferran Hurtado: A Brief Survey | SpringerLink Skip to main content
Advertisement SpringerLink Account Menu Find a journal Publish with us Track your research …

We study biplane graphs drawn on a finite planar point set in general position. This is the
family of geometric graphs whose vertex set is and can be decomposed into two plane …

We study biplane graphs drawn on a finite point set in the plane in general position. This is
the family of geometric graphs whose vertex set is and which can be decomposed into two …

We study biplane graphs drawn on a finite point set S in the plane in general position. This is
the family of geometric graphs whose vertex set is S and can be decomposed into two plane …