GitHunt
EZ

ezgitek/Four-Colorable-Graph

Four color theorem implementation

Here, main aim is to check whether a given graph is colorable by at most four colors or not. I used Welsh-Powell algorithm in order to implement this.

Languages

C++95.0%Makefile5.0%

Contributors

Created March 22, 2016
Updated September 20, 2024
ezgitek/Four-Colorable-Graph | GitHunt