Zobrazeno 1 - 10
of 111
pro vyhledávání: '"Hernández-Vélez P"'
A geometric graph is a graph whose vertices are points in general position in the plane and its edges are straight line segments joining these points. In this paper we give an $O(n^2 \log n)$ algorithm to compute the number of pairs of edges that cro
Externí odkaz:
http://arxiv.org/abs/1904.11037
Autor:
Cristian Torres-León, Fernanda Rebolledo Ramírez, Jorge A. Aguirre-Joya, Agustina Ramírez-Moreno, Mónica L. Chávez-González, David R. Aguillón-Gutierrez, Luis Camacho-Guerra, Nathiely Ramírez-Guzmán, Salvador Hernández Vélez, Cristóbal N. Aguilar
Publikováno v:
Saudi Pharmaceutical Journal, Vol 31, Iss 1, Pp 21-28 (2023)
This study is the first record of medicinal plants in the southwest of the Coahuila state, an arid zone where extreme dry conditions prevail. One hundred twenty-two residents (in sixteen communities) were interviewed. The residents were questioned wi
Externí odkaz:
https://doaj.org/article/91848961a308419d80b7d0fc353c20ce
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Duque, Frank, González-Aguilar, Hernán, Hernández-Vélez, César, Leaños, Jesús, Medina, Carolina
Publikováno v:
Electron. J. Combin. 25 (2018), no. 2, Paper 2.43, 11 pp
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 endpoints) any of these circles. The {\em cylindrical crossing number} of a gr
Externí odkaz:
http://arxiv.org/abs/1708.01942
Autor:
Adrián Hernández Vélez
Publikováno v:
IE Revista de Investigación Educativa de la REDIECH, Vol 14 (2023)
El propósito de esta investigación consistió en conocer los significados que los profesores de escuelas primarias atribuyeron a la docencia ejercida en tiempos de pandemia, en Puebla (México). El estudio tuvo un posicionamiento epistémico de cor
Externí odkaz:
https://doaj.org/article/57311422f918409f86b4af5f4cefc853
Autor:
Fernandes, Cristina G., Hernández-Vélez, César, de Pina, José C., Alfonsín, Jorge Luis Ramírez
We present exponential and super factorial lower bounds on the number of Hamiltonian cycles passing through any edge of the basis graphs of a graphic, generalized Catalan and uniform matroids. All lower bounds were obtained by a common general strate
Externí odkaz:
http://arxiv.org/abs/1608.02635
Autor:
Adrián Hernández Vélez
Publikováno v:
Actualidades Investigativas en Educación, Vol 22, Iss 3 (2022)
En este artículo se analizaron las experiencias directivas que las personas directoras de las escuelas primarias de Puebla, México, desarrollaron en el ejercicio de su función durante la pandemia ocasionada por el virus SARS-Cov-2 (COVID-19). En l
Externí odkaz:
https://doaj.org/article/dceff9e827e842449a561fe4338eb0a1
We consider questions related to the existence of spanning trees in graphs with the property that after the removal of any path in the tree the graph remains connected. We show that, for planar graphs, the existence of trees with this property is clo
Externí odkaz:
http://arxiv.org/abs/1409.4239
A drawing of a graph is {\em pseudolinear} if there is a pseudoline arrangement such that each pseudoline contains exactly one edge of the drawing. The {\em pseudolinear crossing number} of a graph $G$ is the minimum number of pairwise crossings of e
Externí odkaz:
http://arxiv.org/abs/1404.7332
Publikováno v:
Electron. J. Combin. 21 (2014), no. 4, Paper 4.1, 29 pp
Zarankiewicz's Conjecture (ZC) states that the crossing number cr$(K_{m,n})$ equals $Z(m,n):=\floor{\frac{m}{2}} \floor{\frac{m-1}{2}} \floor{\frac{n}{2}} \floor{\frac{n-1}{2}}$. Since Kleitman's verification of ZC for $K_{5,n}$ (from which ZC for $K
Externí odkaz:
http://arxiv.org/abs/1210.1988