☰

César Hernández Vélez

Research interests

Cálculo Superior (2016/2)
Estructuras Algebraicas (2016/2) (2015/2)
Geometría Euclidiana (2016/1)
Matemáticas Discretas (2016/1)
Cálculo Diferencial (2015/2)
Introdução à Teoria dos Grafos (MAC0320)

Hernández-Vélez, César; Leaños, Jesús; Salazar, Gelasio. On the pseudolinear crossing number. J. Graph Theory 84 (2017), no. 3, 297-310.
Fernandes, Cristina G.; Hernández-Vélez, César; Lee, Orlando; de Pina, José C. Spanning trees with nonseparating paths. Discrete Math. 339 (2016), no. 1, 365-374.
Hernández-Vélez, César; Medina, Carolina; Salazar, Gelasio. The optimal drawings of K_5,n. Electron. J. Combin. 21 (2014), no. 4, Paper 4.1, 29pp.
Beaudou, Laurent; Hernández-Vélez, César; Salazar, Gelasio. Making a graph crossing-critical by multiplying its edges. Electron. J. Combin. 20 (2013), no. 1, Paper 61, 14pp.
Hernández-Vélez, César; Salazar, Gelasio; Thomas, Robin. Nested cycles in large triangulations and crossing-critical graphs. J. Combin. Theory Ser. B 102 (2012), no. 1, 86-92.
Cetina, Mario; Hernández-Vélez, César; Leaños, Jesús; Villalobos, Cristóbal. Point sets that minimize (≤ k)-edges, 3-decomposable drawings, and the rectilinear crossing number of K₃₀. Discrete Math. 311 (2011), no. 16, 1646-1657.

Fernandes, Cristina G.; Hernández-Vélez, César; de Pina, José C.; Ramírez Alfonsín, Jorge Luis. Matroid basis graph: Counting Hamiltonian cycles arXiv:1608.02635