# One Color Preprocessing Improves DSATUR

**Published:** September 17, 2026
**Author:** Adam Nouira, Lucas Isenmann
**Source:** arXiv — cs.AI
**Language:** en-US
**HTML:** https://aiqazaqstan.com/en/articles/one-color-preprocessing-improves-dsatur

The Graph Coloring Problem (GCP) is NP-hard and DSATUR stands as one of the fastest heuristics for it despite producing colorings that typically use more colors than state-of-the-art coloring algorithms. We propose SSLD (Semidefinite Spectral Learning with DSATUR), which…

> From the original source: **arXiv — cs.AI**
> [Read full article at arXiv — cs.AI](https://arxiv.org/abs/2609.17633)

**Tags:** #Papers with Code #arXiv

---

*AI Qazaqstan — non-commercial informational portal about AI in Kazakhstan. Machine translations and summaries are AI-generated.*