Satgraphs and independent domination. Part 1
Under an Elsevier user license
open archive
MSC
68Q17
68R10
05C69
05C85
Keywords
Satgraphs
Satisfiability problem
Hereditary class of graphs
Forbidden induced subgraph characterization
Independent domination problem
Polar graphs
Perfect graphs
NP-complete
Polynomial-time algorithm
Cited by (0)
Copyright © 2005 Elsevier B.V. All rights reserved.