J. Tejel

activity

20162025

most citedGeometric Biplane Graphs II: Graph Augmentation

6 citations · 18 across the 13 of their papers we have counts for

collaborators

15 papers

cs.CG2025

A note on non-crossing path partitions in the plane

Javier Tejel

In the paper ``Lower bounds on the number of crossing-free subgraphs of $K_{N}$ '' (Computational Geometry 16 (2000), 211-221), it is shown that a double chain of $n$ points in the pl…

cs.CG2025

Characterizing and Recognizing Twistedness

Oswin Aichholzer, Alfredo García, Javier Tejel +2

In a simple drawing of a graph, any two edges intersect in at most one point (either a common endpoint or a proper crossing). A simple drawing is generalized twisted if it fulfills…

cs.CG2022

Empty Triangles in Generalized Twisted Drawings of $K_{n}$

Alfredo García, Javier Tejel, Birgit Vogtenhuber +1

Simple drawings are drawings of graphs in the plane or on the sphere such that vertices are distinct points, edges are Jordan arcs connecting their endpoints, and edges intersect a…

math.CO2022

Paired and semipaired domination in triangulations

M. Claverol, C. Hernando, M. Maureso +2

A dominating set of a graph $G$ is a subset $D$ of vertices such that every vertex not in $D$ is adjacent to at least one vertex in $D$ . A dominating set $D$ is paired if the subgr…

cs.CG2022

Twisted Ways to Find Plane Structures in Simple Drawings of Complete Graphs

Oswin Aichholzer, Alfredo García, Javier Tejel +2

Simple drawings are drawings of graphs in which the edges are Jordan arcs and each pair of edges share at most one point (a proper crossing or a common endpoint). We introduce a sp…

math.CO2020★ 1 cited

Total domination in plane triangulations

M. Claverol, A. García, G. Hernández +4

A total dominating set of a graph $G = (V, E)$ is a subset $D$ of $V$ such that every vertex in $V$ is adjacent to at least one vertex in $D$ . The total domination number of $G$ , deno…

cs.CG2020

Plane augmentation of plane graphs to meet parity constraints

J. C. Catana, A. García, J. Tejel +1

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 en…

cs.CG2020

Rainbow polygons for colored point sets in the plane

David Flores-Peñaloza, Mikio Kano, Leonardo Martínez-Sandoval +5

Given a colored point set in the plane, a perfect rainbow polygon is a simple polygon that contains exactly one point of each color, either in its interior or on its boundary. Let…

cs.CG2019★ 2 cited

Maximum rectilinear convex subsets

Hernán González-Aguilar, David Orden, Pablo Pérez-Lantero +4

Let $P$ be a set of $n$ points in the plane. We consider a variation of the classical Erdős-Szekeres problem, presenting efficient algorithms with $O (n^{3})$ running time and $O(n^2)…

math.CO2019★ 1 cited

Metric dimension of maximal outerplanar graphs

Mercè Claverol, Alfredo García, Greogorio Hernández +4

In this paper, we study the metric dimension problem in maximal outerplanar graphs. Concretely, if $β (G)$ is the metric dimension of a maximal outerplanar graph $G$ of order $n$ , w…

cs.CG2018

Colored ray configurations

Ruy Fabila-Monroy, Alfredo García, Ferran Hurtado +6

We study the cyclic color sequences induced at infinity by colored rays with apices being a given balanced finite bichromatic point set. We first study the case in which the rays a…

math.CO2017★ 4 cited

$K_{1, 3}$ -covering red and blue points in the plane

Bernardo M. Ábrego, Silvia Fernández-Merchant, Mikio Kano +4

We say that a finite set of red and blue points in the plane in general position can be $K_{1, 3}$ -covered if the set can be partitioned into subsets of size $4$ , with $3$ points of…

cs.CG2017★ 6 cited

Geometric Biplane Graphs II: Graph Augmentation

Alfredo García, Ferran Hurtado, Matias Korman +5

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 which can be decomposed…

cs.CG2017★ 4 cited

Geometric Biplane Graphs I: Maximal Graphs