biconnected graph
graph on at least 3 vertices that remains connected when any one vertex is removed
Facts
4 properties- Subclass of
- k-vertex-connected graph, 2-edge-connected graph, cyclic graph[1][2][3]
- Does not have characteristic
- cut vertex[6]
- Does not have part
- cut vertex[5]
- Studied by
- graph theory[4]
🏷️ Also known as
en nonseparable graph
en 2-vertex-connected graph
en biconnected graph
en non-separable graph
en 2-connected graph
ar بيان ثنائي الترابط
de 2-zusammenhängender Graph
de zweifach knotenzusammenhängender Graph
fa گراف دوهمبند راسی
hu kétszeresen összefüggő gráf
hu nem szétválasztható gráf
ja 2重連結グラフ
ru двусвязный граф
uk двузв'язний граф
zh 雙連通圖
zh-hant 2-連通圖
🔖 Identifiers · 7
- OpenAlex ID
- C45725084
- Dictionary of Algorithms and Data Structures ID
- biconnectedGraph
- Freebase ID
- /m/0cyqs6
- Graphclasses.org ID
- gc_771
- MathWorld ID
- BiconnectedGraph
- Microsoft Academic ID (discontinued)
- 45725084
- Wolfram Language entity code
- Entity["GraphClass", "Biconnected"]
🔗 Connections
Does not have characteristic 1
Does not have part 1
Studied by 1
Subclass of 1
Subtypes 1
← Statement describes 1
Press Enter · cited answer in seconds