Some New Results on Proper Colouring of Edge-set Graphs
General Mathematics
2018-05-08 v1
Abstract
In this paper, we present a foundation study for proper colouring of edge-set graphs. The authors consider that a detailed study of the colouring of edge-set graphs corresponding to the family of paths is best suitable for such foundation study. The main result is deriving the chromatic number of the edge-set graph of a path, , . It is also shown that edge-set graphs for paths are perfect graphs.
Cite
@article{arxiv.1805.02198,
title = {Some New Results on Proper Colouring of Edge-set Graphs},
author = {Johan Kok and Sudev Naduvath},
journal= {arXiv preprint arXiv:1805.02198},
year = {2018}
}
Comments
6 Pages, 2 Figures