César Hernández-Vélez

activity

20092019

(\leq k)

-edges, 3-decomposable drawings, and the rectilinear crossing number of

K_{30}

12 citations · 23 across the 4 of their papers we have counts for

collaborators

Showing 2017Show all

1 paper · 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…

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

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