The following pages link to (Q4836302):
Displaying 6 items.
- Numerical experiences with graph coloring algorithms (Q1070239) (← links)
- The smallest hard-to-color graph (Q1185079) (← links)
- The smallest hard-to-color graph for the SL algorithm (Q1356706) (← links)
- Smallest-last ordering and clustering and graph coloring algorithms (Q3765255) (← links)
- Heuristics versus completeness in graph coloring (Q4484664) (← links)
- (Q4529311) (← links)