Some new results on proper colouring of edge-set graphs
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, Pn+1, n ≥ 1. It is also shown that edge-set graphs for paths are perfect graphs.
Copyright © 2020 Johan Kok, Sudev Naduvath. 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.
Cite this article
J. Kok, S. Naduvath, Some new results on proper colouring of edge-set graphs, J. Math. Comput. Sci. 10 (2020), 544–553. https://doi.org/10.28919/jmcs/4464
BibTeX
@article{Kok2020,
author = {Kok, Johan and Naduvath, Sudev},
title = {Some new results on proper colouring of edge-set graphs},
journal = {J. Math. Comput. Sci.},
volume = {10},
year = {2020},
pages = {544--553},
doi = {10.28919/jmcs/4464}
}