Complexity results for two kinds of colored disconnections of graphs (Q2045036)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Complexity results for two kinds of colored disconnections of graphs
scientific article

    Statements

    Complexity results for two kinds of colored disconnections of graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 August 2021
    0 references
    edge-cut
    0 references
    vertex-cut
    0 references
    rainbow vertex-disconnection
    0 references
    proper disconnection
    0 references
    NP-complete
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references