On CD-chromatic number and its lower bound in some classes of graphs

DOI10.1016/j.dam.2024.01.033WikidataQ128684889 ScholiaQ128684889MaRDI QIDQ6124431

Shalu M. A., Kirubakaran V. K.

Publication date: 27 March 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

coloringcd-coloringsubclique

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

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-chromatic number and its lower bound in some classes of graphs