k-edge-connected graph (Q3034655)
Jump to navigation
Jump to search
graph that remains connected whenever fewer than k edges are removed
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | k-edge-connected graph |
graph that remains connected whenever fewer than k edges are removed |
Statements
Identifiers
Sitelinks
Wikipedia(8 entries)
- dewiki Kantenzusammenhang
- enwiki K-edge-connected graph
- frwiki Graphe arête-connexe
- huwiki K-szorosan élösszefüggő gráf
- jawiki K-辺連結グラフ
- ptwiki Grafo k-aresta-conexo
- ruwiki Рёберно k-связный граф
- ukwiki K-реберно-зв'язний граф