Chromatic completion number

J. Kok, E.G. Mphako-Banda
Published 2020-11-03
DOI 10.28919/jmcs/5028

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.
Full Text: PDF

How to Cite this Article

J. Kok, E.G. Mphako-Banda, Chromatic completion number, J. Math. Comput. Sci., 10 (2020), 2971-2983. https://doi.org/10.28919/jmcs/5028

Copyright © 2020 J. Kok, E.G. Mphako-Banda. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.