Hahn, G.; Kratochvil, J.; Sotteau, D. and Siran, J.
|DOI (Digital Object Identifier) Link:||http://doi.org/10.1016/S0012-365X(01)00466-6|
|Google Scholar:||Look up in Google Scholar|
We define the concepts of an injective colouring and the injective chromatic number of a graph and give some upper and lower bounds in general, plus some exact values. We explore in particular the injective chromatic number of the hypercube and put it in the context of previous work on similar concepts, especially the theory of error-correcting codes. Finally, we give necessary and sufficient conditions for the injective chromatic number to be equal to the degree for a regular graph.
|Item Type:||Journal Article|
|Keywords:||Graph colouring; Codes; Hypercube|
|Academic Unit/Department:||Faculty of Science, Technology, Engineering and Mathematics (STEM) > Mathematics and Statistics
Faculty of Science, Technology, Engineering and Mathematics (STEM)
|Depositing User:||Jozef Širáň|
|Date Deposited:||14 Jun 2007|
|Last Modified:||02 Aug 2016 13:07|
|Share this page:|