F. Duque

activity

20142023

most citedDrawing the Horton Set in an Integer Grid of Minimum Size

7 citations · 13 across the 10 of their papers we have counts for

collaborators

Showing 2017Show all

2 papers · 1 filter

math.CO2017

The complexity of computing the cylindrical and the $t$ -circle crossing number of a graph

Frank Duque, Hernán González-Aguilar, César Hernández-Vélez +2

A plane drawing of a graph is {\em cylindrical} if there exist two concentric circles that contain all the vertices of the graph, and no edge intersects (other than at its endpoint…

math.CO2017

Non-crossing Monotone Paths and Binary Trees in Edge-ordered Complete Geometric Graphs

Frank Duque, Ruy Fabila-Monroy, Carlos Hidalgo-Toscano +1

An edge-ordered graph is a graph with a total ordering of its edges. A path $P = v_{1} v_{2} \dots v_{k}$ in an edge-ordered graph is called increasing if $(v_{i} v_{i + 1}) > (v_{i + 1} v_{i + 2})$ …

The complexity of computing the cylindrical and the t-circle crossing number of a graph

Non-crossing Monotone Paths and Binary Trees in Edge-ordered Complete Geometric Graphs

The complexity of computing the cylindrical and the $t$ -circle crossing number of a graph