Some rainbow problems in graphs have complexity equivalent to satisfiability problems (Q6071083)

From MaRDI portal
scientific article; zbMATH DE number 7771169
Language Label Description Also known as
English
Some rainbow problems in graphs have complexity equivalent to satisfiability problems
scientific article; zbMATH DE number 7771169

    Statements

    Some rainbow problems in graphs have complexity equivalent to satisfiability problems (English)
    0 references
    0 references
    0 references
    27 November 2023
    0 references
    graph theory
    0 references
    complexity theory
    0 references
    uniqueness of solution
    0 references
    rainbow sets
    0 references
    dominating codes
    0 references
    locating-dominating codes
    0 references
    identifying codes
    0 references
    twin-free graphs
    0 references

    Identifiers