[1] **viXra:1704.0175 [pdf]**
*submitted on 2017-04-13 07:02:31*

**Authors:** Q.P.Wimblik

**Comments:** 2 Pages.

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.

**Category:** Data Structures and Algorithms