Algorithmic Aspects of Dominator Colorings in Graphs

No abstract is available for this paper.

• Publication year

  2011

• Venue

  International Workshop on Combinatorial Algorithms

• Publication date

  2011-07-20

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-642-25011-8_2
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Dominator Colorings in Some Classes of Graphs

  2012cited by this paper
• Algorithms - ESA 2009

  2009cited by this paper
• Kernel bounds for disjoint cycles and disjoint paths

  2009cited by this paper
• Contraction Bidimensionality: the Accurate Picture

  2009cited by this paper
• Parameterized approximation of dominating set problems

  2008cited by this paper
• On the Dominator Colorings in Bipartite Graphs

  2007cited by this paper
• On dominator colorings in graphs

  2007cited by this paper
• Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

  2006cited by this paper
• Dominator colorings and safe clique partitions

  2006cited by this paper
• Parameterized Complexity Theory

  2006cited by this paper
• Improved approximation algorithms for minimum-weight vertex separators

  2005cited by this paper
• Dominating sets in planar graphs: branch-width and exponential speed-up

  2003cited by this paper
• Parameterized Complexity

  1998cited by this paper
• The Expression of Graph Properties and Graph Transformations in Monadic Second-Order Logic

  1997cited by this paper
• A threshold of ln n for approximating set cover (preliminary version)

  1996cited by this paper
• The Monadic Second-order Logic of Graphs VI: On Several Representations of Graphs by Relational Structures

  1995cited by this paper
• On the hardness of approximating minimization problems

  1994influential reference
• A still better performance guarantee for approximate graph coloring

  1993cited by this paper
• A Still Better Performance Guarantee for Approximate Graph Coloring

  1993cited by this paper
• A linear time algorithm for finding tree-decompositions of small treewidth

  1993cited by this paper
• Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families

  1992cited by this paper
• Easy Problems for Tree-Decomposable Graphs

  1991cited by this paper
• Monadic Second-Order Evaluations on Tree-Decomposable Graphs

  1991cited by this paper
• The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs

  1990cited by this paper
• The NP-Completeness Column: An Ongoing Guide

  1982cited by this paper
• Johnson: computers and intractability: a guide to the theory of np- completeness (freeman

  1979cited by this paper
• Some Simplified NP-Complete Graph Problems

  1976cited by this paper
• On the ratio of optimal integral and fractional covers

  1975cited by this paper
• Approximation algorithms for combinatorial problems

  1973cited by this paper
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph

  1972cited by this paper

• On CD-chromatic number and its lower bound in some classes of graphs

  2024cites this paper
• Dominated coloring in certain networks

  2024cites this paper
• Complexity of Total Dominator Coloring in Graphs

  2023cites this paper
• Dominator Coloring of Total Graph of Path and Cycle

  2023cites this paper
• Dominator Coloring Parameterized by Cluster Vertex Deletion Number

  2022cites this paper
• Dominator Coloring and CD Coloring in Almost Cluster Graphs

  2022influential citation
• On cd-Coloring of P5, K4-free Chordal Graphs

  2022cites this paper
• Dominator and Total Dominator Colorings in Graphs

  2021cites this paper
• Analytical modeling on the coloring of certain graphs for applications of air traffic and air scheduling management

  2021cites this paper
• On the complexity of minimum q-domination partization problems

  2021influential citation
• Dominator and total dominator coloring of circulant graph Cn (1, 2)

  2021cites this paper
• On cd-Coloring of Trees and Co-bipartite Graphs

  2021cites this paper
• Lower bounds on approximating some variations of vertex coloring problem over restricted graph classes

  2020cites this paper
• On the complexity of cd-coloring of graphs

  2020cites this paper
• On strict strong coloring of graphs

  2020cites this paper
• Linear time algorithm for dominator chromatic number of trestled graphs

  2019cites this paper
• International Journal of Innovative Technology and Exploring Engineering (IJITEE)

  2019influential citation
• Dominator and Total Dominator Coloring on Square Chessboard

  2019cites this paper
• Dominator Chromatic Numbers of Orientations of Trees

  2019cites this paper
• Dominator Colorings of Digraphs

  2019cites this paper
• A Linear Algorithm for Minimum Dominator Colorings of Orientations of Paths

  2019cites this paper
• An Annotated Glossary of Graph Theory Parameters, with Conjectures

  2018cites this paper
• A Lower Bound of the cd-Chromatic Number and Its Complexity

  2017cites this paper
• On some domination colorings of graphs

  2017cites this paper
• Algorithms and Discrete Applied Mathematics - Third International Conference, CALDAM 2017, Sancoale, Goa, India, February 16-18, 2017, Proceedings

  2017cites this paper
• Dominator Coloring of Generalized Petersen Graphs

  2016cites this paper
• Dominator Colorings of Products of Graphs

  2016cites this paper
• The cd-Coloring of Graphs

  2016cites this paper
• An algorithm for the dominator chromatic number of a tree

  2015cites this paper
• Dominated Colorings of Graphs

  2015cites this paper
• Dominated Colorings of Graphs

  2014cites this paper
• On the complexity of various parameterizations of common induced subgraph isomorphism

  2014cites this paper
• An algorithm for the dominator chromatic number of a tree

  2013cites this paper
• On dominator colorings in graphs

  2012cites this paper