Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets
From MaRDI portal
Publication:2570105
DOI10.1016/j.disc.2005.06.020zbMath1073.05047OpenAlexW2004006664MaRDI QIDQ2570105
Johannes H. Hattingh, Michael A. Henning, Wayne Goddard, Michael J. Dorfling
Publication date: 26 October 2005
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2005.06.020
Related Items
Minimal graphs with disjoint dominating and paired-dominating sets, Coupon-coloring and total domination in Hamiltonian planar triangulations, A survey of selected recent results on total domination in graphs, Some results for the two disjoint connected dominating sets problem, Disjoint dominating and 2-dominating sets in graphs, Restrained and Total Restrained Domination in Graphs, Partitioning the Vertices of a Graph into Two Total Dominating Sets, Algorithm and complexity of the two disjoint connected dominating sets problem on trees
Cites Work