Graph coloring is a fundamental concept in graph theory that involves assigning colors to the vertices of a graph such that no two adjacent vertices share the same color. The minimum number of ...

This crate provides algorithms for solving the graph vertex coloring problem. These algorithms return a "coloring", i.e. an assignment of each vertex to a "color" (index) such that no two vertices of ...

The graph coloring problem, a classical problem in graph theory. In its simplest form, the graph coloring problem consists in assigning a color to each of its vertices so that two vertices connected ...

Conflict-free coloring is an intriguing area of study in graph theory that focuses on assigning colors to the vertices of a graph in such a way that certain conditions are met regarding the colors ...