Pages that link to "Item:Q3352500"
From MaRDI portal
The following pages link to Some sequential graph colouring algorithms (Q3352500):
Displaying 6 items.
- Sequential coloring versus Welsh-Powell bound (Q1121275) (← links)
- Hard-to-color graphs for connected sequential colorings (Q1329800) (← links)
- The smallest hard-to-color graph for the SL algorithm (Q1356706) (← links)
- An exact method for graph coloring (Q2489282) (← links)
- A systematic study on meta-heuristic approaches for solving the graph coloring problem (Q2664279) (← links)
- (Q4529311) (← links)