Hypercube coloring and the structure of binary codes
A coloring of a graph is an assignment of colors to its vertices so that no two adjacent vertices are given the same color. The chromatic number of a graph is the least number of colors needed to color all of its vertices. Graph coloring problems can be applied to many real world applications, such...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
University of British Columbia
2008
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/2429/2809 |