César Hernández-Vélez

11 papers Journal 11
YearRankTypeTitle / Venue / Authors
2021 J jnl
Counting the number of crossings in geometric graphs.
Inf. Process. Lett.
Frank Duque, Ruy Fabila-Monroy, César Hernández-Vélez, Carlos Hidalgo-Toscano
2019 J jnl
Counting Hamiltonian Cycles in the Matroid Basis Graph.
Graphs Comb.
Cristina G. Fernandes, César Hernández-Vélez, José Coelho de Pina, Jorge Luis Ramírez Alfonsín
2019 J jnl
Counting the Number of Crossings in Geometric Graphs.
CoRR
Frank Duque, Ruy Fabila-Monroy, César Hernández-Vélez, Carlos Hidalgo-Toscano
2018 J jnl
The Complexity of Computing the Cylindrical and the t-Circle Crossing Number of a Graph.
Electron. J. Comb.
Frank Duque, Hernán González-Aguilar, César Hernández-Vélez, Jesús Leaños, Carolina Medina
2017 J jnl
On the Pseudolinear Crossing Number.
J. Graph Theory
César Hernández-Vélez, Jesús Leaños, Gelasio Salazar
2016 J jnl
Spanning trees with nonseparating paths.
Discret. Math.
Cristina G. Fernandes, César Hernández-Vélez, Orlando Lee, José Coelho de Pina
2014 J jnl
The Optimal Drawings of $K_{5, n}$.
Electron. J. Comb.
César Hernández-Vélez, Carolina Medina, Gelasio Salazar
2013 J jnl
Making a Graph Crossing-Critical by Multiplying its Edges.
Electron. J. Comb.
Laurent Beaudou, César Hernández-Vélez, Gelasio Salazar
2012 J jnl
Nested cycles in large triangulations and crossing-critical graphs.
J. Comb. Theory B
César Hernández-Vélez, Gelasio Salazar, Robin Thomas
2012 J jnl
The optimal drawings of K_{5,n}
CoRR
César Hernández-Vélez, Carolina Medina, Gelasio Salazar
2011 J jnl
Point sets that minimize (≤k)-edges, 3-decomposable drawings, and the rectilinear crossing number of K
Discret. Math.
Mario Cetina, César Hernández-Vélez, Jesús Leaños, C. Villalobos