k-vertex-connected graph (Q3115621)

From Wikidata
Jump to: navigation, search
a graph that cannot be disconnected by the deletion of fewer than k vertices
edit
Language Label Description Also known as
English
k-vertex-connected graph
a graph that cannot be disconnected by the deletion of fewer than k vertices

    Statements

    0 references

    Identifiers

     
    edit
      edit
        edit
          edit
            edit
              edit
                edit