Abstract: The graph coloring problem involves coloring the nodes of a graph using the minimum number of colors such that no two adjacent nodes share the same color. This NP-hard problem has various ...

You can create a release to package software, along with release notes and links to binary files, for other people to use. Learn more about releases in our docs.

Abstract: The acyclic coloring problem, a specialized area within graph coloring, has numerous applications across diverse fields. It involves assigning colors to the vertices of a graph such that no ...

Pull requests help you collaborate on code with other people. As pull requests are created, they’ll appear here in a searchable and filterable list. To get started, you should create a pull request.

The amplituhedron, a shape at the heart of particle physics, appears to be deeply connected to the mathematics of paper ...