Chromatic Coloring of Distance Graphs I
V. Yegnanarayanan · International Journal of Innovative Technology and Exploring Engineering · 2021
The primary aim of this paper is to publicize various problems regarding chromatic coloring of finite, simple and undirected graphs. A simple motivation for this work is that the coloring of graphs gives models for a variety of real world problems such as scheduling. We prove some interesting results related to the computation of chromatic number of certain distance graphs and also discuss some open problems.