Total domination, separated-cluster, CD-coloring: algorithms and hardness
type: Item
instance of: scholarly article
title: Total domination, separated-cluster, CD-coloring: algorithms and hardness
DOI: 10.1007/978-3-031-55598-5_7
author: Dhanyamol Antony
author: L. Sunil Chandran
author: Ankit Gayen
author: Shirish Gosavi
author: Dalu Jacob
publication date: 2024-05-31T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
Mathematics Subject Classification ID: 68Rxx
Mathematics Subject Classification ID: 68Wxx
zbMATH DE Number: 7857843
zbMATH Keywords: total domination
zbMATH Keywords: CD-coloring
zbMATH Keywords: separated-cluster
zbMATH Keywords: CD-perfectness
zbMATH Keywords: triangle-free \(d\)-regular graphs
MaRDI profile type: Publication
cites work: The strong perfect graph theorem
cites work: Dominated colorings of graphs
cites work: On the complexity of cd-coloring of graphs
cites work: On cd-coloring of trees and co-bipartite graphs
cites work: Dominator coloring and CD coloring in almost cluster graphs
cites work: Parameterized and exact algorithms for class domination coloring
cites work: Dominated and dominator colorings over (edge) corona and hierarchical products
cites work: Total domination in regular graphs
cites work: Total Domination in Graphs
cites work: Cluster graph modification problems
cites work: A Lower Bound of the cd-Chromatic Number and Its Complexity
cites work: Relations between the lower domination parameters and the chromatic number of a graph.
cites work: Dominator colorings in some classes of graphs
cites work: Sur le coloriage des graphs
cites work: Q4492757
cites work: Parameterized Algorithms
cites work: Domination in convex and chordal bipartite graphs
cites work: A linear time algorithm to compute square of interval graphs and their colouring
cites work: Q4448764
cites work: Q4770411
cites work: Strong cliques in diamond-free graphs
description: scientific article; zbMATH DE number 7857843