This project implements an algorithm to find the Minimum Vertex Cover of an undirected graph using Maximum Satisfiability (MaxSAT). The program is written in Java and operates in two modes: reading ...

Graph Coloring is the process of assigning colors to the vertices of a graph such that no two adjacent vertices share the same color. The main goal is to use the minimum number of colors possible ...