Brunel University Research Archive(BURA) preserves and enables easy and open access to all
types of digital content. It showcases Brunel's research outputs.
Research contained within BURA is open access, although some publications may be subject
to publisher imposed embargoes. All awarded PhD theses are also archived on BURA.
Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/3328Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Krasikov, I | - |
| dc.contributor.author | Roditty, Y | - |
| dc.coverage.spatial | 5 | en |
| dc.date.accessioned | 2009-05-22T11:32:54Z | - |
| dc.date.available | 2009-05-22T11:32:54Z | - |
| dc.date.issued | 1994 | - |
| dc.identifier.citation | Journal of Graph Theory. 18 (2) 205-209 | en |
| dc.identifier.other | DOI: 10.1002/jgt.319018021 | - |
| dc.identifier.uri | http://bura.brunel.ac.uk/handle/2438/3328 | - |
| dc.description.abstract | The upper bound for the harmonious chromatic number of a graph given by Zhikang Lu and by C. McDiarmid and Luo Xinhua, independently (Journal of Graph Theory, 1991, pp. 345-347 and 629-636) and the lower bound given by D. G. Beane, N. L. Biggs, and B. J. Wilson (Journal of Graph Theory, 1989, pp. 291-298) are improved. | en |
| dc.format.extent | 175 bytes | - |
| dc.format.mimetype | text/plain | - |
| dc.language.iso | en | - |
| dc.publisher | Wiley | en |
| dc.title | Bounds for the harmonious chromatic number of a graph | en |
| dc.type | Research Paper | en |
| Appears in Collections: | Dept of Mathematics Research Papers Mathematical Sciences | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Article_info.txt | 175 B | Text | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.