Q3115621

From Wikidata
Jump to: navigation, search

K-vertex-connected graph (Q3115621)[edit]

a graph that cannot be disconnected by the deletion of fewer than k vertices [edit]

No aliases defined. [add]

Statements

/m/0265hsh
[edit]
1 reference
[add]