One Color Preprocessing Improves DSATUR

arXiv:2609.17633v1 Announce Type: new Abstract: The Graph Coloring Problem GCP is NPhard and DSATUR stands as one of the fastest heuristics for it despite producing colorings that typically use more colors than stateoftheart coloring algorithms.