k-vertex-connected graph (Q3115621)
Jump to navigation
Jump to search
graph that cannot be disconnected by the deletion of fewer than k vertices
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | k-vertex-connected graph |
graph that cannot be disconnected by the deletion of fewer than k vertices |
Statements
Identifiers
1 reference
Sitelinks
Wikipedia(11 entries)
- dewiki K-Zusammenhang
- enwiki K-vertex-connected graph
- frwiki Graphe sommet-connexe
- huwiki K-szorosan összefüggő gráf
- jawiki K-頂点連結グラフ
- plwiki Graf k-spójny
- ptwiki Grafo k-vértice-conexo
- rowiki Graf k-conex
- ruwiki Вершинно k-связный граф
- ukwiki K-вершинно-зв'язний граф
- viwiki K-liên thông