(Q3115621)

English

k-vertex-connected graph

graph that cannot be disconnected by the deletion of fewer than k vertices

In more languages

Statements

connected graph

0 references

4-connected graph.svg
500 × 500; 664 bytes

0 references

0 references

has characteristic

vertex connectivity

0 references

manifestation of

graph connectivity

0 references

maintained by WikiProject

WikiProject Mathematics

0 references

k-edge-connected graph

0 references

Identifiers

1 reference

Freebase Data Dumps

publication date

28 October 2013

k-ConnectedGraph

0 references

Microsoft Academic ID

0 references

1 reference

26 January 2022

https://docs.openalex.org/download-snapshot/snapshot-data-format

Sitelinks

Wikipedia(11 entries)

Wikibooks(0 entries)

Wikinews(0 entries)

Wikiquote(0 entries)

Wikisource(0 entries)

Wikiversity(0 entries)

Wikivoyage(0 entries)

Wiktionary(0 entries)

Multilingual sites(0 entries)

Retrieved from "https://www.wikidata.org/w/index.php?title=Q3115621&oldid=2059683313"