Exploració per autor "Tejel Altarriba, Francisco Javier"
Ara es mostren els items 1-14 de 14
-
Blocking the k-holes of point sets in the plane
(2015-09)
Article
Accés obertLet P be a set of n points in the plane in general position. A subset H of P consisting of k elements that are the vertices of a convex polygon is called a k-hole of P, if there is no element of P in the interior of its ... -
Colored Ray configurations
(2014)
Text en actes de congrés
Accés obertWe study the cyclic sequences induced at in nity by pairwise-disjoint colored rays with apices on a given bal- anced bichromatic point set, where the color of a ray is inherited from the color of its apex. We derive a lower ... -
Colored ray configurations
(2018-05)
Article
Accés obertWe 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 are required to be pairwise disjoint. We ... -
Compatible spanning trees
(2014-07-01)
Article
Accés obertTwo plane geometric graphs are said to be compatible when their union is a plane geometric graph. Let S be a set of n points in the Euclidean plane in general position and let T be any given plane geometric spanning tree ... -
Configurations of non-crossing rays and related problems
(2016-04)
Article
Accés obertLet S be a set of n points in the plane and let R be a set of n pairwise non-crossing rays, each with an apex at a different point of S. Two sets of non-crossing rays R1R1 and R2R2 are considered to be different if the ... -
Dimensión métrica y dimensión métrica tolerante en grafos MOP.
(2023)
Text en actes de congrés
Accés obertEn este trabajo estudiamos la dimensión métrica y la dimensión métrica tolerante en grafos periplanos maximales. Concretamente, damos cotas ajustadas de ambos parámetros y caracterizamos los grafos que alcanzan las cotas ... -
Geometric biplane graphs I: maximal graphs
(2013)
Text en actes de congrés
Accés obert -
Geometric biplane graphs I: maximal graphs
(2015-03-01)
Article
Accés obertWe 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 graphs. We show that two maximal biplane ... -
Geometric biplane graphs II: graph augmentation
(2015-03-01)
Article
Accés obertWe 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 plane graphs. We show that every ... -
Geometric Biplane Graphs II: Graph Augmentation
(2013)
Text en actes de congrés
Accés obertWe study biplane graphs drawn on a nite 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 into two plane graphs. We show that every ... -
K-1,K-3-covering red and blue points in the plane
(Chapman & Hall/CRC, 2019-01-31)
Article
Accés obertWe say that a finite set of red and blue points in the plane in general position can be K1,3-covered if the set can be partitioned into subsets of size 4, with 3 points of one color and 1 point of the other color, in such ... -
Paired and semipaired domination in near-triangulations
(2022-07-22)
Report de recerca
Accés obertA 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 subgraph induced by its vertices has a perfect matching, ... -
Total domination in plane triangulations
(2020-11-09)
Report de recerca
Accés obert -
Total domination in plane triangulations
(2021-01-01)
Article
Accés obertA total dominating set of a graph is a subset of such that every vertex in is adjacent to at least one vertex in . The total domination number of , denoted by , is the minimum cardinality of a total dominating set of . A ...
