Partitioning a graph into a dominating set, a total dominating set, and something else
From MaRDI portal
Publication:2997583
DOI10.7151/DMGT.1514zbMath1217.05179OpenAlexW2077208430MaRDI QIDQ2997583
Michael A. Henning, Dieter Rautenbach, Christian Löwenstein
Publication date: 9 May 2011
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://www.db-thueringen.de/receive/dbt_mods_00040558
Related Items (7)
Graphs with disjoint 2-dominating sets ⋮ Minimal graphs with disjoint dominating and paired-dominating sets ⋮ Disjoint dominating and total dominating sets in graphs ⋮ A unified greedy approximation for several dominating set problems ⋮ Dominating and total dominating partitions in cubic graphs ⋮ Disjoint dominating and 2-dominating sets in graphs ⋮ Algorithm and complexity of the two disjoint connected dominating sets problem on trees
This page was built for publication: Partitioning a graph into a dominating set, a total dominating set, and something else
