A complete resolution of the Keller maximum clique problem
A d-dimensional Keller graph has vertices which are numbered with each of the 4[superscript d] possible d-digit numbers (d-tuples) which have each digit equal to 0, 1, 2, or 3. Two vertices are adjacent if their labels differ in at least two positions, and in at least one position the difference in...
| Main Authors: | , , , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Association for Computing Machinery (ACM)
2013
|
| Online Access: | http://hdl.handle.net/1721.1/81184 https://orcid.org/0000-0003-4626-5648 |