Pages that link to "Item:Q2971664"
From MaRDI portal
The following pages link to A Lower Bound of the cd-Chromatic Number and Its Complexity (Q2971664):
Displayed 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 cd-coloring of graphs (Q2181255) (← links)
- Parameterized and exact algorithms for class domination coloring (Q2659082) (← links)
- On cd-coloring of \(\{P_5,K_4\}\)-free chordal graphs (Q6102271) (← links)
- On CD-chromatic number and its lower bound in some classes of graphs (Q6124431) (← links)
