Total domination, separated-cluster, CD-coloring: algorithms and hardness

DOI10.1007/978-3-031-55598-5_7MaRDI QIDQ6547920

Dhanyamol Antony, Shirish Gosavi, L. Sunil Chandran, Ankit Gayen, Dalu Jacob

Publication date: 31 May 2024

zbMATH Keywords

total dominationCD-coloringCD-perfectnessseparated-clustertriangle-free \(d\)-regular graphs

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear time algorithm to compute square of interval graphs and their colouring
• Dominator colorings in some classes of graphs
• On cd-coloring of trees and co-bipartite graphs
• The strong perfect graph theorem
• Domination in convex and chordal bipartite graphs
• Relations between the lower domination parameters and the chromatic number of a graph.
• Cluster graph modification problems
• Total domination in regular graphs
• On the complexity of cd-coloring of graphs
• Dominated colorings of graphs
• Parameterized and exact algorithms for class domination coloring
• Dominated and dominator colorings over (edge) corona and hierarchical products
• A Lower Bound of the cd-Chromatic Number and Its Complexity
• Total Domination in Graphs
• Parameterized Algorithms
• Sur le coloriage des graphs
• Strong cliques in diamond-free graphs
• Dominator coloring and CD coloring in almost cluster graphs

This page was built for publication: Total domination, separated-cluster, CD-coloring: algorithms and hardness