On cd-coloring of trees and co-bipartite graphs

DOI10.1007/978-3-030-67899-9_16OpenAlexW3127220662MaRDI QIDQ831718

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)

Related Items (1)

On cd-coloring of \(\{P_5,K_4\}\)-free chordal graphs

Cites Work

• Unnamed Item
• Unnamed Item
• The strong perfect graph theorem
• Dominating cliques in \(P_ 5\)-free graphs
• On the complexity of cd-coloring of graphs
• Dominated colorings of graphs
• The cd-Coloring of Graphs
• Parameterized and Exact Algorithms for Class Domination Coloring
• A Lower Bound of the cd-Chromatic Number and Its Complexity
• Algorithmic Aspects of Dominator Colorings in Graphs

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