Chromatic Completion Number

2018/09/04 by Eunice Mphako-Banda, Mphako-Banda, E. G, Johan Kok +1
Computer Science · #05C15 #05C38 #05C75 #05C85 #Advanced Graph Theory Research #FOS: Mathematics #General Mathematics (math.GM) #Graph Labeling and Dimension Problems

paper · pdf · doi:10.48550/arxiv.1809.01136

openalex publication_date 2018/09/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We use a well known concept of proper vertex colouring of a graph to introduce the construction of a chromatic completion graph and its related parameter, the chromatic completion number of a graph. We then give the chromatic completion number of certain classes of cycle derivative graphs and helm graphs. Finally, we discuss further problems for research related to this concept.

Related

• Stability in Respect of Chromatic Completion of Graphs
• Total Colourings - A survey
• Total b-chromatic Colouring of Graphs
• Colouring a graph with position sets
• Research problem: The completion number of a graph