César Hernández-Vélez

According to our database, César Hernández-Vélez authored at least 9 papers between 2011 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

Counting the number of crossings in geometric graphs.

Frank Duque, Ruy Fabila Monroy, César Hernández-Vélez, Carlos Hidalgo-Toscano

Inf. Process. Lett., 2021

2019

Counting Hamiltonian Cycles in the Matroid Basis Graph.

Cristina G. Fernandes, César Hernández-Vélez, José Coelho de Pina, Jorge Luis Ramírez Alfonsín

Graphs Comb., 2019

2018

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, Jesús Leaños, Carolina Medina

Electron. J. Comb., 2018

2017

On the Pseudolinear Crossing Number.

César Hernández-Vélez, Jesús Leaños, Gelasio Salazar

J. Graph Theory, 2017

2016

Spanning trees with nonseparating paths.

Cristina G. Fernandes, César Hernández-Vélez, Orlando Lee, José Coelho de Pina

Discret. Math., 2016

2014

The Optimal Drawings of $K_{5, n}$.

César Hernández-Vélez, Carolina Medina, Gelasio Salazar

Electron. J. Comb., 2014

2013

Making a Graph Crossing-Critical by Multiplying its Edges.

Laurent Beaudou, César Hernández-Vélez, Gelasio Salazar

Electron. J. Comb., 2013

2012

Nested cycles in large triangulations and crossing-critical graphs.

César Hernández-Vélez, Gelasio Salazar, Robin Thomas

J. Comb. Theory B, 2012

2011

Point sets that minimize (≤k)-edges, 3-decomposable drawings, and the rectilinear crossing number of K₃₀.

Mario Cetina, César Hernández-Vélez, Jesús Leaños, C. Villalobos

Discret. Math., 2011