NP-completeness of the independent dominating set problem in the class of cubic planar bipartite graphs (Q5090153)

From MaRDI portal
scientific article; zbMATH DE number 7558115
Language Label Description Also known as
English
NP-completeness of the independent dominating set problem in the class of cubic planar bipartite graphs
scientific article; zbMATH DE number 7558115

    Statements

    NP-completeness of the independent dominating set problem in the class of cubic planar bipartite graphs (English)
    0 references
    15 July 2022
    0 references
    0 references
    independent dominating set
    0 references
    cubic graph
    0 references
    planar graph
    0 references
    bipartite graph
    0 references
    NP-completeness
    0 references
    0 references