Pages that link to "Item:Q2181255"
From MaRDI portal
The following pages link to On the complexity of cd-coloring of graphs (Q2181255):
Displaying 8 items.
- On cd-coloring of trees and co-bipartite graphs (Q831718) (← links)
- On the complexity of minimum \(q\)-domination partization problems (Q2125219) (← links)
- Parameterized and exact algorithms for class domination coloring (Q2659082) (← links)
- Lower bounds on approximating some variations of vertex coloring problem over restricted graph classes (Q5859496) (← 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)
- Approximation algorithm for minimum \(q\)-dominator partization problem (Q6542935) (← links)
- Total domination, separated-cluster, CD-coloring: algorithms and hardness (Q6547920) (← links)