The following pages link to (Q2761069):
Displayed 6 items.
- Using local search to speed up filtering algorithms for some NP-hard constraints (Q545546) (← links)
- Complexity of unique list colorability (Q935144) (← links)
- On defining numbers of vertex colouring of regular graphs (Q1292860) (← links)
- Uniquely 2-list colorable graphs (Q1613346) (← links)
- Unique list-colourability and the fixing chromatic number of graphs (Q2576344) (← links)
- Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints (Q5387639) (← links)