5 papers · 1 filter
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 '' (Computational Geometry 16 (2000), 211-221), it is shown that a double chain of points in the pl…
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…
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…
Plane augmentation of plane graphs to meet parity constraints
J. C. Catana, A. García, J. Tejel +1
A plane topological graph 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…
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…