Codex Wiki
OurBigBook.com
Site
Source code
Vertex connectivity
ï
Home
Mathematics
Area of mathematics
Foundations of mathematics
Graph theory
Menger theorem
OurBigBook.com
Words: 64
Articles: 2
Vertex connectivity
Îș
(
G
)
is the smallest number of vertices whose deletion disconnects a nontrivial graph or reduces it to one vertex.
Table of contents
64
2
Dirac circumference theorem
Vertex connectivity
43
1
Longest-cycle attachment argument
Dirac circumference theorem
30
ïą
Ancestors
(6)
Menger theorem
Graph theory
Foundations of mathematics
Area of mathematics
Mathematics
ï
Home