- idUS
- Listar por autor
Listar por autor "Cera López, Martín"
Mostrando ítems 1-16 de 16
-
Artículo
A network approach to analyze neuronal lineage and layer innervation in the Drosophila optic lobes
Valle Rodríguez, Alberto del; Cera López, Martín; Portillo Fernández, José Ramón (Public Library of Science, 2020)The optic lobes of the fruit fly Drosophila melanogaster form a highly wired neural network composed of roughly 130.000 ...
-
Artículo
An advance in infinite graph models for the analysis of transportation networks
Cera López, Martín; Fedriani Martel, Eugenio Manuel (De Gruyter, 2016)This paper extends to infinite graphs the most general extremal issues, which are problems of determining the maximum number ...
-
Capítulo de Libro
Aplicaciones de la teoría de grafos en la neurogénesis
Cera López, Martín; Desplan, C.; Portillo, J. R.; Valle, A. del (Universidad de Almería, 2015)El l´obulo ´optico de la Drosophila (mosca de la fruta) es una estructura altamente sofisticada con m´as de 60.000 neuronas ...
-
Artículo
Extremal Graphs without Topological Complete Subgraphs
Cera López, Martín; Diánez Martínez, Ana Rosa; Márquez Pérez, Alberto (2004)The exact values of the function $ex(n;TK_{p})$ are known for ${\lceil \frac{2n+5}{3}\rceil}\leq p < n$ (see [Cera, Diánez, ...
-
Tesis Doctoral
Grafos contractibles a un grafo completo
Valenzuela Tripodoro, Juan Carlos (2006)Los objetivos de esta tesis se pueden enmarcar dentro de la Teoría Extremal de Grafos. Uno de los problemas más conocidos ...
-
Artículo
Locating a Central Hunter on the Plane
Cera López, Martín; Mesa López-Colmenar, Juan Antonio; Ortega Riejos, Francisco Alonso; Plastria, Frank (Springer, 2007)Protection, surveillance or other types of coverage services of mobile points call for different, asymmetric distance ...
-
Ponencia
Máximas aristas de un grafo sin subgrafos menores completos
Cera López, Martín; Diánez Martínez, Ana Rosa; García Vázquez, Pedro; Valenzuela Tripodoro, Juan Carlos (Alberto Márquez, 2002) -
Artículo
On the Ramsey numbers for stars versus complete graphs
Boza Prieto, Luis; Cera López, Martín; García Vázquez, P.; Revuelta Marchena, María Pastora (Elsevier, 2010)For graphs G1, . . . , Gs, the multicolor Ramsey number R(G1, . . . , Gs) is the smallest integer r such that if we give ...
-
Ponencia
El problema de Turán sobre grafos bipartitos completos
Cera López, Martín; Diánez Martínez, Ana Rosa; García Vázquez, Pedro; Valenzuela Tripodoro, Juan Carlos (Alberto Márquez, 2002) -
Tesis Doctoral
Problemas extremales en teoría de grafos
García Vázquez, Pedro (2003)Uno de los problemas más representativos dentro de la Teoría Extremal de Grafos consiste en el estudio de los valores de ...
-
Artículo
Superconnectivity of Networks Modeled by the Strong Product of Graphs
Moreno Casablanca, Rocío; Cera López, Martín; García Vázquez, Pedro; Valenzuela Tripodoro, Juan Carlos (University of Belgrade, 2015)Maximal connectivity and superconnectivity in a network are two important features of its reliability. In this paper, ...
-
Tesis Doctoral
El tamaño de un grafo sin subgrafos homeomorfos a un grafo completo
Cera López, Martín (1998)"Desde el origen de la Teoría de Grafos Extremales, uno de los problemas más generales que pueden plantearse en este campo, ...
-
Artículo
The Size of a Graph Without Topological Complete Subgraphs
Cera López, Martín; Diánez Martínez, Ana Rosa; Márquez Pérez, Alberto (2000)In this note we show a new upperbound for the function ex(n;TKp), i.e., the maximum number of edges of a graph of order n ...
-
Capítulo de Libro
Theoretical progress on infinite graphs and their average degree: applicability to the European Road Transport Network
Cera López, Martín; Fedriani, E.M. (IEEE Computer Society, 2015)There are many problems in Graph Theory for finite graphs relating the number of vertices and the number of edges and, ...
-
Capítulo de Libro
Theoretical progress on infinite graphs and their average degree: applicability to the European Road Transport Network
Cera López, Martín; Fedriani Martel, Eugenio Manuel (IEEE Computer Society, 2015)There are many problems in Graph Theory for finite graphs relating the number of vertices and the number of edges and, ...
-
Artículo
Topological minors in bipartite graphs
Balbuena, Camino; Cera López, Martín; García Vázquez, Pedro; Valenzuela, Juan Carlos (Springer, 2011-10-15)For a bipartite graph G on m and n vertices, respectively, in its vertices classes, and for integers s and t such that 2 ...