Total Coloring algorithm implementation
-
Updated
Feb 23, 2022 - Prolog
Total Coloring algorithm implementation
Verification of the Total Coloring Conjecture for all graphs with at most 14 vertices using a SAT Modulo Symmetry Solver.
Add a description, image, and links to the total-coloring topic page so that developers can more easily learn about it.
To associate your repository with the total-coloring topic, visit your repo's landing page and select "manage topics."