felixm/discrete_optimization
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Implement prune and branch for graph coloring. Already works better than previous solution.

Browse Source
This commit is contained in:
Felix Martin
2020-01-09 16:13:47 -05:00
parent 126d7103fa
commit e84f4c6efc
4 changed files with 142 additions and 245 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
coloring/coloring.md
View File

@@ -2,4 +2,11 @@
## Relation to coloring
A clique cover of a graph G may be seen as a graph coloring of the complement graph of G, the graph on the same vertex set that has edges between non-adjacent vertices of G. Like clique covers, graph colorings are partitions of the set of vertices, but into subsets with no adjacencies (independent sets) rather than cliques. A subset of vertices is a clique in G if and only if it is an independent set in the complement of G, so a partition of the vertices of G is a clique cover of G if and only if it is a coloring of the complement of G.
A clique cover of a graph G may be seen as a graph coloring of the complement
graph of G, the graph on the same vertex set that has edges between
non-adjacent vertices of G. Like clique covers, graph colorings are partitions
of the set of vertices, but into subsets with no adjacencies (independent sets)
rather than cliques. A subset of vertices is a clique in G if and only if it is
an independent set in the complement of G, so a partition of the vertices of G
is a clique cover of G if and only if it is a coloring of the complement of G.