A polynomial time algorithm for cyclic vertex connectivity of cubic graphs (Q4976338)

From MaRDI portal
scientific article; zbMATH DE number 6754541
Language Label Description Also known as
English
A polynomial time algorithm for cyclic vertex connectivity of cubic graphs
scientific article; zbMATH DE number 6754541

    Statements

    A polynomial time algorithm for cyclic vertex connectivity of cubic graphs (English)
    0 references
    0 references
    0 references
    0 references
    28 July 2017
    0 references
    cyclic vertex connectivity
    0 references
    maximum flow
    0 references
    computational complexity
    0 references
    cubic graph
    0 references

    Identifiers