(Q3034655)

English

k-edge-connected graph

graph that remains connected whenever fewer than k edges are removed

In more languages

Statements

connected graph

0 references

2-edge-connected.jpg
182 × 205; 10 KB

0 references

0 references

has characteristic

k-edge-connectivity

0 references

manifestation of

graph connectivity

0 references

maintained by WikiProject

WikiProject Mathematics

0 references

k-vertex-connected graph

0 references

Identifiers

1 reference

Freebase Data Dumps

publication date

28 October 2013

k-Edge-ConnectedGraph

0 references

Microsoft Academic ID

0 references

Sitelinks

Wikipedia(8 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=Q3034655&oldid=1961007495"