The cd-coloring of graphs
DOI10.1007/978-3-319-29221-2_29zbMATH Open1437.05078OpenAlexW2404880248MaRDI QIDQ2795960FDOQ2795960
Authors: M. A. Shalu, T. P. Sandhya 
Publication date: 23 March 2016
Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-29221-2_29
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- Complexity of graph partition problems
- Four classes of perfectly orderable graphs
- Algorithmic aspects of dominator colorings in graphs
- Dominator colorings and safe clique partitions
- Colour class domination numbers of some classes of graphs
- Color class domination number of middle graph and center graph of \(K_{1,n}\), \(C_n\) and \(P_n\)
- Domination integrity of middle graphs
Cited In (9)
- On cd-coloring of trees and co-bipartite graphs
- On the algorithmic aspects of strong subcoloring
- A lower bound of the cd-chromatic number and its complexity
- On the complexity of cd-coloring of graphs
- Parameterized and exact algorithms for class domination coloring
- Parameterized and exact algorithms for class domination coloring
- Colored and proper-colored-domination
- On cd-coloring of \(\{P_5,K_4\}\)-free chordal graphs
- On CD-chromatic number and its lower bound in some classes of graphs
This page was built for publication: The cd-coloring of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2795960)
