Martín Cera

Eugenio M. Fedriani

Int. J. Appl. Math. Comput. Sci., 2016

2010

On the Ramsey numbers for stars versus complete graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2010

2008

Diameter-girth sufficient conditions for optimal extraconnectivity in graphs.

[BibT_eX]

[DOI]

Discret. Math., 2008

On the girth of extremal graphs without shortest cycles.

[BibT_eX]

[DOI]

Discret. Math., 2008

2007

Graphs without minor complete subgraphs.

[BibT_eX]

[DOI]

Juan Carlos Valenzuela

Discret. Math., 2007

On the restricted connectivity and superconnectivity in graphs with given girth.

[BibT_eX]

[DOI]

Discret. Math., 2007

Connectivity of graphs with given girth pair.

[BibT_eX]

[DOI]

Discret. Math., 2007

New exact values of the maximum size of graphs free of topological complete subgraphs.

[BibT_eX]

[DOI]

Discret. Math., 2007

On the edge-connectivity and restricted edge-connectivity of a product of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

2005

Sufficient conditions for lambda'-optimality of graphs with small conditional diameter.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2005

2004

Extremal Graphs without Topological Complete Subgraphs.

[BibT_eX]

[DOI]

Alberto Márquez

SIAM J. Discret. Math., 2004

Minor clique free extremal graphs.

[BibT_eX]

Juan Carlos Valenzuela

Ars Comb., 2004

2003

Complete bipartite free graphs.

[BibT_eX]

Juan Carlos Valenzuela

Ars Comb., 2003

2001

Structure of the Extremal Family ex(n;tkp).

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

2000

The Size of a Graph Without Topological Complete Subgraphs.

[BibT_eX]

[DOI]