Journal article icon

Journal article

Colouring proximity graphs in the plane

Abstract:

Given a set V of points in the plane and given d>0, let G(V, d) denote the graph with vertex set V and with distinct vertices adjacent whenever the Euclidean distance between them is less than d. We are interested in colouring such 'proximity' graphs. One application where this problem arises is in the design of cellular telephone networks, where we need to assign radio channels (colours) to transmitters (p...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:
Publisher copy:
10.1016/S0012-365X(98)00292-1

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Statistics
Role:
Author
Publisher:
Elsevier Publisher's website
Journal:
Discrete Mathematics Journal website
Volume:
199
Issue:
1–3
Pages:
123–137
Publication date:
1999-03-01
DOI:
ISSN:
0012-365X
Language:
English
Keywords:
Subjects:
UUID:
uuid:497ee397-357e-48d7-b253-6d9dee2a2512
Local pid:
ora:8448
Deposit date:
2014-05-15

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP