Journal article icon

Journal article

Graph Imperfection.

Abstract:

We are interested in colouring a graph G = (V, E) together with an integral weight or demand vector x = (xv: v ε V) in such a way that xv colours are assigned to each node v, adjacent nodes are coloured with disjoint sets of colours, and we use as few colours as possible. Such problems arise in the design of cellular communication systems, when radio channels must be assigned to transmitters to satisfy demand and avoid interference. We are particularly interested in the ratio of chromatic num...

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

Actions


Access Document


Files:
Publisher copy:
10.1006/jctb.2001.2042

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Mathematical Institute
Role:
Author
More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Statistics
Role:
Author
More from this funder
Name:
UK Radiocommunications Agency
Funding agency for:
Gerke, S
Grant:
97004215
More from this funder
Name:
Engineering and Physical Sciences Research Council
Funding agency for:
Gerke, S
Grant:
97004215
Publisher:
Elsevier
Journal:
Journal of Combinatorial Theory, Series B More from this journal
Volume:
83
Issue:
1
Pages:
58-78
Publication date:
2001-01-01
DOI:
ISSN:
0095-8956
Language:
English
Keywords:
UUID:
uuid:a708faa7-8287-484f-9ecb-23cd3e154d2f
Local pid:
pubs:102307
Source identifiers:
102307
Deposit date:
2012-12-19

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