Determine whether a given graph is k-colorable for some k.
Given a graph in the well-known DIMACS format, the program outputs a CNF file. This is then fed to an external SAT solver.
-
Notifications
You must be signed in to change notification settings - Fork 0
jplauri/satcol
About
Graph coloring through satisfiability
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published