Hostname: page-component-78c5997874-s2hrs Total loading time: 0 Render date: 2024-11-09T01:40:07.687Z Has data issue: false hasContentIssue false
  • English
  • Français

Distant Vertex Partitions of Graphs

Published online by Cambridge University Press:  01 December 1998

CHRIS JAGGER
CHRIS JAGGER
Affiliation:
Department of Pure Mathematics and Mathematical Statistics, 16 Mill Lane, Cambridge CB2 1SB, England (e-mail: C.N.Jagger@dpmms.cam.ac.uk)
Get access Rights & Permissions [Opens in a new window]

Abstract

We consider the function χ(Gk), defined to be the smallest number of colours that can colour a graph G in such a way that no vertices of distance at most k receive the same colour. In particular we shall look at how small a value this function can take in terms of the order and diameter of G. We get general bounds for this and tight bounds for the cases k=2 and k=3.

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 7 , Issue 4 , December 1998 , pp. 413 - 422
Copyright
1998 Cambridge University Press

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.)