Hostname: page-component-78c5997874-94fs2 Total loading time: 0 Render date: 2024-11-14T22:10:34.161Z Has data issue: false hasContentIssue false
  • English
  • Français

A generalization of the chromatic number†

Published online by Cambridge University Press:  24 October 2008

G. Chartrand ,
D. P. Geller  and
S. Hedetniemi
G. Chartrand
Affiliation:
Western Michigan University, The University of Michigan, The University of Iowa
D. P. Geller
Affiliation:
Western Michigan University, The University of Michigan, The University of Iowa
S. Hedetniemi
Affiliation:
Western Michigan University, The University of Michigan, The University of Iowa
Get access Rights & Permissions [Opens in a new window]

Extract

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.

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 64 , Issue 2 , April 1968 , pp. 265 - 271
Copyright
Copyright © Cambridge Philosophical Society 1968

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCE

(1)Harary, F.A seminar on graph theory (New York, 1967).Google Scholar