Satgraphs and independent domination. I (Q818113)

From MaRDI portal
Revision as of 12:28, 24 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Satgraphs and independent domination. I
scientific article

    Statements

    Satgraphs and independent domination. I (English)
    0 references
    24 March 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    satgraphs
    0 references
    satisfiability problem
    0 references
    hereditary class of graphs
    0 references
    forbidden induced subgraph characterization
    0 references
    independent domination problem
    0 references
    polar graphs
    0 references
    perfect graphs
    0 references
    NP-complete
    0 references
    polynomial-time algorithm
    0 references
    0 references