Q3034655

From Wikidata
Jump to: navigation, search

K-edge-connected graph (Q3034655)[edit]

a graph that remains connected whenever fewer than k edges are removed [edit]

No aliases defined. [add]

Statements