The complexity of connected dominating sets and total dominating sets with specified induced subgraphs
type: Item
instance of: scholarly article
title: The complexity of connected dominating sets and total dominating sets with specified induced subgraphs
zbMATH Open document ID: 1259.68084
author: Oliver Schaudt
author: Rainer Schrader
published in: Information Processing Letters
publication date: 2013-03-21T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 6147768
zbMATH Keywords: connected domination
zbMATH Keywords: total domination
zbMATH Keywords: dominating subgraphs
zbMATH Keywords: computational complexity
zbMATH Keywords: combinatorial problems
MaRDI profile type: Publication
full work available at URL: j.ipl.2012.09.002
OpenAlex ID: W1987967894
cites work: Q4368728
cites work: Acyclic domination
cites work: Q5463526
cites work: Dominating and large induced trees in regular graphs
cites work: Dominating cliques in graphs
cites work: Dominating cliques in \(P_ 5\)-free graphs
cites work: An exact algorithm for the minimum dominating clique problem
cites work: Threshold dominating cliques in random graphs and interval routing
cites work: Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs
cites work: Complete description of forbidden subgraphs in the structural domination problem
cites work: Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs
cites work: Restricted total domination in graphs
cites work: Hereditary domination and independence parameters
cites work: Graph Classes: A Survey
cites work: Q4198056
cites work: Planar 3DM is NP-complete
cites work: A note on connected dominating sets of distance-hereditary graphs
DOI: 10.1016/J.IPL.2012.09.002
description: scientific article; zbMATH DE number 6147768