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.
-
Notifications
You must be signed in to change notification settings - Fork 1
ezgitek/Four-Colorable-Graph
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Four color theorem implementation
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published