Open AccessChromatic Coloring of Distance Graphs I
Author(s) -
V. Yegnanarayanan
Publication year - 2021
Publication title -
international journal of innovative technology and exploring engineering
Language(s) - English
Resource type - Journals
ISSN - 2278-3075
DOI - 10.35940/ijitee.i9291.0710921
Subject(s) - chromatic scale , graph coloring , greedy coloring , chordal graph , brooks' theorem , computer science , combinatorics , complete coloring , mathematics , simple (philosophy) , indifference graph , undirected graph , fractional coloring , discrete mathematics , graph , 1 planar graph , line graph , epistemology , philosophy , graph power
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom