The cd-coloring of graphs

DOI10.1007/978-3-319-29221-2_29MaRDI QIDQ2795960zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

time complexityvertex coloringsplit graphscd-coloring

Mathematics Subject Classification ID

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)

Recommendations

• On the complexity of cd-coloring of graphs
• A lower bound of the cd-chromatic number and its complexity
• Parameterized and exact algorithms for class domination coloring
• Parameterized and exact algorithms for class domination coloring
• Colored and proper-colored-domination

Cites work

• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• Algorithmic aspects of dominator colorings in graphs
• Color class domination number of middle graph and center graph of \(K_{1,n}\), \(C_n\) and \(P_n\)
• Colour class domination numbers of some classes of graphs
• Complexity of graph partition problems
• Domination integrity of middle graphs
• Dominator colorings and safe clique partitions
• Four classes of perfectly orderable 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)