Computation of Pseudocoloring of Graphs through Python

Abstract

In the task of coloring the vertices of a simple graph G one come across innumerable number of challenges. There are various graph coloring parameters available in the literature. The concept of pseudo coloring is quite interesting. In this type of coloring, we can allot same color to the adjacent vertices. The maximum number of colors used in a pseudocoloring where for any two distinct colors, one can always find at least one edge between them is called pseudo achromatic number, ѱ(G) of G. In the paper we determine this coloring parameter for some classes of graphs through python code.