#### Filter Results:

#### Publication Year

1996

2015

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez, Xavier Marcote
- Discrete Mathematics
- 2007

- Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez, Xavier Marcote
- Inf. Process. Lett.
- 2005

- Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez, Xavier Marcote
- Discrete Applied Mathematics
- 2007

- Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez, Xavier Marcote
- Discrete Mathematics
- 2008

For a connected graph G, the r-th extraconnectivity κ r (G) is defined as the minimum cardinality of a cutset X such that all remaining components after the deletion of the vertices of X have at least r+1 vertices. The standard connectivity and superconnectivity correspond to κ 0 (G) and κ 1 (G), respectively. The minimum r-tree degree of G, denoted by ξ r… (More)

- Martín Cera, Ana Diánez, Pedro García-Vázquez, Juan Carlos Valenzuela
- Ars Comb.
- 2004

- E. Abajo, Ana Diánez
- Discrete Applied Mathematics
- 2010

- E. Abajo, Camino Balbuena, Ana Diánez
- Discrete Applied Mathematics
- 2010

- E. Abajo, R. M. Casablanca, Ana Diánez, Pedro García-Vázquez
- Discrete Mathematics
- 2013

- Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez, Xavier Marcote
- Discrete Mathematics
- 2007

Girth pairs were introduced by Harary and Kovács [Regular graphs with given girth pair, J. Graph Theory 7 (1983) 209–218]. The odd girth (even girth) of a graph is the length of a shortest odd (even) cycle. Let g denote the smaller of the odd and even girths, and let h denote the larger. Then (g, h) is called the girth pair of the graph. In this paper we… (More)

- Martín Cera, Ana Diánez, Pedro García-Vázquez, Juan Carlos Valenzuela
- Discrete Mathematics
- 2007