On equitable chromatic completion of some graph classes

Abstract

An edge of a properly vertex-colored graph is said to be a good edge if it has end vertices of different color. The chromatic completion graph of a graph G is a graph obtained by adding all possible good edges to G. The chromatic completion number of G is the maximum number of new good edges added to G. An equitable coloring of a graph G is a proper vertex coloring of G such that the difference of cardinalities of any two color classes is at most 1. In this paper, we discuss the chromatic completion graphs and chromatic completion number of certain graph classes, with respect to their equitable coloring.