Pages that link to "Item:Q2971145"
From MaRDI portal
The following pages link to Parameterized and Exact Algorithms for Class Domination Coloring (Q2971145):
Displaying 6 items.
- On cd-coloring of trees and co-bipartite graphs (Q831718) (← links)
- On the algorithmic aspects of strong subcoloring (Q1752633) (← links)
- On the complexity of minimum \(q\)-domination partization problems (Q2125219) (← links)
- On the complexity of cd-coloring of graphs (Q2181255) (← links)
- A Lower Bound of the cd-Chromatic Number and Its Complexity (Q2971664) (← links)
- On CD-chromatic number and its lower bound in some classes of graphs (Q6124431) (← links)
