biconnected graph
Ilme
type of graph
mille alamklass
k-vertex-connected graph
järjekorranumber: 2
seda uurib
on omadusega
vertex connectivity
lower limit: 2
does not have characteristic
cut vertex
does not have part
cut vertex
Viited
- ↑ OpenAlex, 26. jaanuar 2022, https://docs.openalex.org/download-snapshot/snapshot-data-format