6 citations · 18 across the 13 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
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 '' (Computational Geometry 16 (2000), 211-221), it is shown that a double chain of 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…