On cd-coloring of trees and co-bipartite graphs

DOI10.1007/978-3-030-67899-9_16MaRDI QIDQ831718zbMATH OpenOpenAlexFDO

Authors M. A. Shalu, V. K. Kirubakaran

Publication date 24 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-67899-9_16

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A lower bound of the cd-chromatic number and its complexity
• 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\)
• Dominated colorings of graphs
• Dominating cliques in \(P_ 5\)-free graphs
• Domination integrity of middle graphs
• On the complexity of cd-coloring of graphs
• Parameterized and exact algorithms for class domination coloring
• The cd-coloring of graphs
• The strong perfect graph theorem

Cited in

(4)

• On the complexity of cd-coloring of graphs
• On cd-coloring of \(\{P_5,K_4\}\)-free chordal graphs
• \([r,s,t]\)-coloring of trees and bipartite graphs
• Total domination, separated-cluster, CD-coloring: algorithms and hardness

This page was built for publication: On cd-coloring of trees and co-bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831718)