On the Plane-Width of Graphs

https://doi.org/10.1016/j.endm.2009.07.107Get rights and content

Abstract

Map vertices of a graph to (not necessarily distinct) points of the plane so that two adjacent vertices are mapped at least a unit distance apart. The plane-width of a graph is the minimum diameter of the image of the vertex set over all such mappings. We establish a relation between the plane-width of a graph and its chromatic number, and connect it to other well-known areas, including the circular chromatic number and the problem of packing unit discs in the plane.

References (7)

  • A. Bezdek et al.

    Minimal diameter of certain sets in the plane

    J. Comb. Theory, Ser. A

    (1999)
  • P. Bateman et al.

    Geometrical extrema suggested by a lemma of Besicovitch

    American Math. Monthly

    (1951)
  • B. Bollobás

    The chromatic number of random graphs

    Combinatorica

    (1988)
There are more references available in the full text version of this article.
View full text
Copyright © 2009 Elsevier B.V. All rights reserved.