k-edge-connected graph (Q3034655)

From Wikidata
Jump to navigation Jump to search
graph that remains connected whenever fewer than k edges are removed
edit
Language Label Description Also known as
English
k-edge-connected graph
graph that remains connected whenever fewer than k edges are removed

    Statements

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

    Identifiers

     
    edit
      edit
        edit
          edit
            edit
              edit
                edit
                  edit