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
    No aliases defined
[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

    /m/0265hsh
    1 reference
    0 references
    [edit]
    [edit]
    [edit]
    [edit]
    [edit]
    [edit]