Chromatic completion number

Abstract

The well known concept of proper vertex colouring of a graph is used to introduce the construction of a chromatic completion graph and determining its related parameter, the chromatic completion number of a graph. The chromatic completion numbers of certain classes of cycle derivative graphs and helm graphs are then presented. Finally, we discuss further problems for research related to this concept.