Partitioning a graph into a dominating set, a total dominating set, and something else
type: Item
instance of: scholarly article
title: Partitioning a graph into a dominating set, a total dominating set, and something else
zbMATH Open document ID: 1217.05179
author: Michael A. Henning
author: Dieter Rautenbach
author: Christian Löwenstein
published in: Discussiones Mathematicae Graph Theory
publication date: 2011-05-09T00:00:00Z
full work available at URL: dbt mods 00040558
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 5885803
zbMATH Keywords: domination
zbMATH Keywords: total domination
zbMATH Keywords: domatic number
zbMATH Keywords: vertex partition, Petersen graph
MaRDI profile type: Publication
OpenAlex ID: W2077208430
DOI: 10.7151/DMGT.1514
Recommended article: Partitioning the Vertices of a Graph into Two Total Dominating Sets
Recommended article: Q5206383
Recommended article: Q4980977
Recommended article: Q4209364
Recommended article: Q4457743
Recommended article: Q4904311
Recommended article: Partitioning the vertices of a cubic graph into two total dominating sets
Recommended article: Total domination in partitioned graphs
Recommended article: Q5327070
Recommended article: Q5858343
description: scientific article