Disjoint dominating and total dominating sets in graphs
type: Item
instance of: scholarly article
title: Disjoint dominating and total dominating sets in graphs
zbMATH Open document ID: 1208.05099
author: Michael A. Henning
author: Christian Löwenstein
author: Dieter Rautenbach
author: Justin Southey
published in: Discrete Applied Mathematics
publication date: 2010-11-05T00:00:00Z
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 5810756
zbMATH Keywords: domination
zbMATH Keywords: total domination
zbMATH Keywords: vertex partition
MaRDI profile type: Publication
full work available at URL: j.dam.2010.06.004
OpenAlex ID: W2088380012
cites work: Q5463534
cites work: Q5463488
cites work: Approximating theDomatic Number
cites work: Q3115050
cites work: Q4368728
cites work: Q4368729
cites work: Q3615799
cites work: Remarks about disjoint dominating sets
cites work: Partitioning a graph into a dominating set, a total dominating set, and something else
cites work: Q3070350
cites work: A Characterization of Graphs with Disjoint Dominating and Total Dominating Sets
cites work: Inverse domination in graphs
cites work: Pairs of disjoint dominating sets and the minimum degree of graphs
cites work: Q4206780
cites work: Q4378635
DOI: 10.1016/J.DAM.2010.06.004
description: scientific article; zbMATH DE number 5810756