A program to demostrate if the Petersen graph is n-colorable graph , and the relations of the colorable problem with the clique problem.
-
Updated
Jun 28, 2019 - C++
A program to demostrate if the Petersen graph is n-colorable graph , and the relations of the colorable problem with the clique problem.
Add a description, image, and links to the the-petersen-graph topic page so that developers can more easily learn about it.
To associate your repository with the the-petersen-graph topic, visit your repo's landing page and select "manage topics."