The following pages link to (Q4529311):
Displaying 6 items.
- Sequential coloring versus Welsh-Powell bound (Q1121275) (← links)
- The smallest hard-to-color graph (Q1185079) (← links)
- Hard-to-color graphs for connected sequential colorings (Q1329800) (← links)
- The smallest hard-to-color graph for the SL algorithm (Q1356706) (← links)
- Heuristics versus completeness in graph coloring (Q4484664) (← links)
- (Q4836302) (← links)