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:
-
-
(Version of record, pdf, 896.6KB)
-
- Publisher copy:
- 10.1016/S0012-365X(98)00292-1
Why is the content I wish to access not available via ORA?
Bibliographic data (the information relating to research outputs) and full-text items (e.g. articles, theses, reports, etc.) arrive in ORA from several different sources. Unfortunately we are not able to make available the full-text for every research output.
Please contact the ORA team (
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
Content may be unavailable for the following four reasons
-
Version unsuitable
-
We have not obtained a suitable full-text for a given research output. See this page for more information.
-
Recently completed
-
Sometimes content is held in ORA but is unavailable for a fixed period of time to comply with the policies and wishes of rights holders.
-
Permissions
-
All content made available in ORA should comply with relevant rights, such as copyright. See this page for more information.
-
Clearance
-
Some thesis volumes scanned as part of the digitisation scheme funded by Dr Leonard Polonsky are currently unavailable due to sensitive material or uncleared third-party copyright content. We are attempting to contact authors whose theses are affected.
Alternative access to the full-text
You may be able to access the full-text directly from the publisher's website using the 'Publisher Copy' link in the 'Links & Downloads' box from a research output's ORA record page. This method may require an institutional or individual subscription to the journal/resource.
Authors
Bibliographic Details
- 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
Item Description
- Language:
- English
- Keywords:
- Subjects:
- UUID:
-
uuid:497ee397-357e-48d7-b253-6d9dee2a2512
- Local pid:
- ora:8448
- Deposit date:
- 2014-05-15
Related Items
Terms of use
- Copyright holder:
- Elsevier BV
- Copyright date:
- 1999
- Notes:
- Copyright Elsevier B.V. All rights reserved. Re-use of this article is permitted in accordance with the Terms and Conditions set out at http://www.elsevier.com/open-access/userlicense/1.0/
- Licence:
- Other
If you are the owner of this record, you can report an update to it here: Report update to this record