Mine sisu juurde

biconnected graph

Lehekülje sisu ei toetata teistes keeltes.

type of graph

Välised allikad

Freebase
Microsoft Academic ID
OpenAlex ID
Dictionary of Algorithms and Data Structures ID

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