Abstract
One of the most widely studied concepts in graph theory is that of the colouring of graphs. Much of the research in this area has dealt with the chromatic number χ(G) of a graph G, defined as the minimum number of colours which can be assigned to the points of G so that adjacent points are coloured differently. One can obtain a natural generalization of this concept as follows: we define the n-chromatic number χn (G) to be the smallest number of colours which one can associate with the points of G so that not all points on any path of length n are coloured the same. The 1-chromatic number is then simply the chromatic number.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Mathematical Proceedings of the Cambridge Philosophical Society
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
