### Abstract

We consider the general problem of determining a smallest set of edges which must be added to a given graph (hypergraph, digraph) in order to make it k-edge-connected (k-vertex-connected). We give a short summary of those cases of the augmentation problems which have been solved by polynomial algorithms and min-max formulae. We then describe some recent progress we have made on the vertex-connectivity augmentation problem for undirected graphs.

Original language | English |
---|---|

Pages (from-to) | 1-4 |

Number of pages | 4 |

Journal | Electronic Notes in Discrete Mathematics |

Volume | 5 |

Publication status | Published - Dec 1 2000 |

### Keywords

- Graph algorithms
- Graph connectivity

### ASJC Scopus subject areas

- Discrete Mathematics and Combinatorics
- Applied Mathematics

## Fingerprint Dive into the research topics of 'Connectivity augmentation of graphs'. Together they form a unique fingerprint.

## Cite this

Jackson, B., & Jordán, T. (2000). Connectivity augmentation of graphs.

*Electronic Notes in Discrete Mathematics*,*5*, 1-4.