Q3034655

From Wikidata
Jump to: navigation, search

k-edge-connected graph(Q3034655)

a graph that remains connected whenever fewer than k edges are removed
    No aliases defined.
[edit]
Language Label Description Also known as
English
k-edge-connected graph
a graph that remains connected whenever fewer than k edges are removed

    Statements

    /m/0cbmtf
    1 reference
    0 references
    [edit]
    [edit]
    [edit]
    [edit]
    [edit]
    [edit]