Complexity of computing of the domination number in hereditary classes of graphs.

MaRDI QIDQ5492624zbMATH OpenFDO

Authors Olga I. Zverovich, I.È. Zverovich

Publication date 16 October 2006

zbMATH Keywords

\(\gamma \)-complete graphdomination numberhereditary class

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• scientific article; zbMATH DE number 4204394
• scientific article; zbMATH DE number 7742925
• A complexity dichotomy and a new boundary class for the dominating set problem
• scientific article; zbMATH DE number 468640
• On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size

Cited in

(4)

• Parameterized complexity of finding subgraphs with hereditary properties.
• Polar SAT and related graphs
• A complexity dichotomy and a new boundary class for the dominating set problem
• The price of connectivity for dominating set: upper bounds and complexity

This page was built for publication: Complexity of computing of the domination number in hereditary classes of graphs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5492624)