Dominator coloring and CD coloring in almost cluster graphs

DOI10.1007/978-3-031-38906-1_8arXiv2210.17321OpenAlexW4385317356MaRDI QIDQ6138994

Aritra Banik, Venkatesh Raman, Prahlad Narasimhan Kasthurirangan

Publication date: 16 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2210.17321

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Data reduction for graph coloring problems
• Exact algorithms for cluster editing: Evaluation and experiments
• Exact exponential algorithms.
• Dominator colorings in some classes of graphs
• Monadic second-order evaluations on tree-decomposable graphs
• Fixed-parameter algorithms for cluster vertex deletion
• A more effective linear kernelization for cluster editing
• Going weighted: parameterized algorithms for cluster editing
• Precoloring extension. I: Interval graphs
• Structural parameterizations of dominating set variants
• Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity
• Upper bounds to the clique width of graphs
• Dominated colorings of graphs
• An algorithm for the dominator chromatic number of a tree
• Total dominator colorings and total domination in graphs
• Dominator colorings of certain Cartesian products of paths and cycles
• On some domination colorings of graphs
• Tight bounds for parameterized complexity of cluster editing with a small number of clusters
• Parameterized and exact algorithms for class domination coloring
• Dominated and dominator colorings over (edge) corona and hierarchical products
• On the dominator coloring in proper interval graphs and block graphs
• On the dominator colorings in trees
• Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width
• Algorithmic Aspects of Dominator Colorings in Graphs
• Set Partitioning via Inclusion-Exclusion
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters
• Kernelization
• Parameterized Algorithms
• Parameterized Pre-Coloring Extension and List Coloring Problems

This page was built for publication: Dominator coloring and CD coloring in almost cluster graphs