The following pages link to (Q4982508):
Displayed 5 items.
- On the algorithmic aspects of strong subcoloring (Q1752633) (← links)
- On the complexity of cd-coloring of graphs (Q2181255) (← links)
- The cd-Coloring of Graphs (Q2795960) (← links)
- A Lower Bound of the cd-Chromatic Number and Its Complexity (Q2971664) (← links)
- Lower bounds on approximating some variations of vertex coloring problem over restricted graph classes (Q5859496) (← links)