NameCera López, Martín
DepartmentMatemática Aplicada I
Knowledge areaMatemática Aplicada
Professional categoryCatedrático de Escuela Universitaria
E-mailRequest
         
  • No. publications

    16

  • No. visits

    1972

  • No. downloads

    2838


 

Article
Icon

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 ...
Article
Icon

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 ...
Article
Icon

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, using ...
Chapter of Book
Icon

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, ...
Chapter of Book
Icon

Aplicaciones de la teoría de grafos en la neurogénesis

Cera López, Martín; Desplan, C.; Portillo, J. R.; Valle, A. del; Cáceres, Jose; Luz Puertas, María (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 ...
Chapter of Book
Icon

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, ...
Article
Icon

Topological minors in bipartite graphs

Balbuena, Camino; Cera López, Martín; García Vázquez, Pedro; Valenzuela, Juan Carlos (Springer, 2011)
For a bipartite graph G on m and n vertices, respectively, in its vertices classes, and for integers s and t such that 2 ...
Article
Icon

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 ...
Article
Icon

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 ...
PhD Thesis
IconIcon

Grafos contractibles a un grafo completo

Valenzuela Tripodoro, Juan Carlos; Cera López, Martín; García Vázquez, Pedro (2006)
Los objetivos de esta tesis se pueden enmarcar dentro de la Teoría Extremal de Grafos. Uno de los problemas más conocidos ...
Article
Icon

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, ...
PhD Thesis
Icon

Problemas extremales en teoría de grafos

García Vázquez, Pedro; Cera López, Martín; Diánez Martínez, Ana Rosa (2003)
Uno de los problemas más representativos dentro de la Teoría Extremal de Grafos consiste en el estudio de los valores de ...
Presentation
Icon

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)
Presentation
Icon

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)
Article
Icon

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 ...
PhD Thesis
Icon

El tamaño de un grafo sin subgrafos homeomorfos a un grafo completo

Cera López, Martín; Diánez Martínez, Ana Rosa; Márquez Pérez, Alberto (1998)
"Desde el origen de la Teoría de Grafos Extremales, uno de los problemas más generales que pueden plantearse en este campo, ...