Algorithmic Aspects of Dominator Colorings in Graphs
From MaRDI portal
Publication:3111637
DOI10.1007/978-3-642-25011-8_2zbMath1314.68215OpenAlexW1809657861MaRDI QIDQ3111637
Geevarghese Philip, Saket Saurabh, S. Arumugam, K. Raja Chandrasekar, Neeldhara Misra
Publication date: 13 January 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-25011-8_2
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
On the complexity of minimum \(q\)-domination partization problems, On cd-coloring of trees and co-bipartite graphs, Dominator and total dominator coloring of circulant graph Cn(1, 2), On dominator colorings in graphs, On some domination colorings of graphs, On the complexity of various parameterizations of common induced subgraph isomorphism, On the complexity of cd-coloring of graphs, On the double total dominator chromatic number of graphs, On cd-coloring of \(\{P_5,K_4\}\)-free chordal graphs, On CD-chromatic number and its lower bound in some classes of graphs, Dominator coloring and CD coloring in almost cluster graphs, Complexity of total dominator coloring in graphs, A Lower Bound of the cd-Chromatic Number and Its Complexity, On the dominator coloring in proper interval graphs and block graphs, The cd-Coloring of Graphs, Linear time algorithm for dominator chromatic number of trestled graphs, Dominator and Total Dominator Colorings in Graphs, Lower bounds on approximating some variations of vertex coloring problem over restricted graph classes, On strict strong coloring of graphs, Dominated colorings of graphs, An algorithm for the dominator chromatic number of a tree
