Pairs of disjoint dominating sets in connected cubic graphs
type: Item
instance of: scholarly article
title: Pairs of disjoint dominating sets in connected cubic graphs
zbMATH Open document ID: 1256.05174
author: Christian Löwenstein
author: Dieter Rautenbach
published in: Graphs and Combinatorics
publication date: 2012-12-27T00:00:00Z
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 6118559
zbMATH Keywords: cubic graphs
zbMATH Keywords: domination number
zbMATH Keywords: domatic number
zbMATH Keywords: inverse domination
zbMATH Keywords: disjoint domination number
zbMATH Keywords: dominating sets
MaRDI profile type: Publication
full work available at URL: s00373-011-1050-1
OpenAlex ID: W2033290650
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: Domination in a graph with a 2‐factor
cites work: On domination in connected cubic graphs
cites work: An upper bound on the domination number of \(n\)-vertex connected cubic graphs
cites work: Domination number of cubic graphs with large girth
cites work: Inverse domination in graphs
cites work: Domination in graphs of minimum degree at least two and large girth
cites work: Pairs of disjoint dominating sets and the minimum degree of graphs
cites work: Domination in graphs with minimum degree two
cites work: Q3291034
cites work: Domination in Cubic Graphs of Large Girth
cites work: Paths, Stars and the Number Three
DOI: 10.1007/S00373-011-1050-1
description: scientific article; zbMATH DE number 6118559