Vertex Coloring can be reduced to a set of 2 color vertex coloring problems. This is achieved by utilizing an ability to account for every positive integer with a unique pair of smaller integers.
Comments: 2 Pages.
[v1] 2017-04-13 07:02:31
Unique-IP document downloads: 13 times
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.