The following pages link to The smallest hard-to-color graph (Q1185079):
Displaying 6 items.
- Hard-to-color graphs for connected sequential colorings (Q1329800) (← links)
- The smallest hard-to-color graph for the SL algorithm (Q1356706) (← links)
- Online algorithms for the maximum \(k\)-colorable subgraph problem (Q1652561) (← links)
- Smallest-last ordering and clustering and graph coloring algorithms (Q3765255) (← links)
- (Q4529311) (← links)
- (Q4836302) (← links)