255 c File: hamming6-4.clq c c Source: Panos Pardalos pardalos@math.ufl.edu c c Reference: hamminga-b is a Hamming graph on a-bit words with c an edge if and only if the two words are at least c hamming distance b apart c p edge 64 704  @€+MŽq ²@Ô€è+MŽq² Ô@@耀++¿MMߎŽïqq÷ ²²û@ÔÔý€èèþ+¿+MßMŽïŽq÷q² û² Ô@ýÔ@è€þè€+¿++MßMMŽïŽŽq÷qq²û ² ²Ôý@Ô@Ôèþ€è€è¿+++ßMMMŽ÷qqqû²² ² ýÔÔ@Ô@@þèè€è€€