On the complexity of domination number determination in monogenic classes of graphs

DOI10.1515/DMA.1992.2.2.191MaRDI QIDQ4284972zbMATH OpenOpenAlexFDO

Authors D. V. Korobitsin

Publication date 19 April 1994

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/dma.1992.2.2.191

zbMATH Keywords

dominating setNP-completeforbidden subgraph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99)

Cited in

(5)

• A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs
• Critical hereditary graph classes: a survey
• A complexity dichotomy and a new boundary class for the dominating set problem
• Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs
• Tree-Width and Optimization in Bounded Degree Graphs

This page was built for publication: On the complexity of domination number determination in monogenic classes of graphs

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