A polynomial algorithm determining cyclic vertex connectivity of \(k\)-regular graphs with fixed \(k\) (Q2424662)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A polynomial algorithm determining cyclic vertex connectivity of \(k\)-regular graphs with fixed \(k\)
scientific article

    Statements

    A polynomial algorithm determining cyclic vertex connectivity of \(k\)-regular graphs with fixed \(k\) (English)
    0 references
    0 references
    0 references
    25 June 2019
    0 references
    cyclic vertex connectivity
    0 references
    \(k\)-regular graph
    0 references
    maximum flow
    0 references
    time complexity
    0 references

    Identifiers