256 c File: hamming6-2.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 1824 @€p°Ôè¿ß@ï€÷pû°ýÔþèÿ¿ÿßÿ@ïÿ€÷ÿpûÿ°ýÿÔþÿèÿÿ¿¿ÿßß@ÿïï€ÿ÷÷pÿûû°ÿýýÔÿþþèÿÿÿ¿ÿÿÿßÿÿÿ@ïÿÿÿ€÷ÿÿÿpûÿÿÿ°ýÿÿÿÔþÿÿÿèÿÿÿÿ¿ÿÿ¿ÿßÿÿß@ÿïÿÿï€ÿ÷ÿÿ÷pÿûÿÿû°ÿýÿÿýÔÿþÿÿþèÿÿÿÿÿÿ¿ÿ¿ÿÿÿßÿßÿ@ÿÿïÿïÿ€ÿÿ÷ÿ÷ÿpÿÿûÿûÿ°ÿÿýÿýÿÔÿÿþÿþÿèÿÿÿÿÿÿÿ¿ÿ¿¿ÿÿÿßÿßß@ÿÿÿïÿïï€ÿÿÿ÷ÿ÷÷pÿÿÿûÿûû°ÿÿÿýÿýýÔÿÿÿþÿþþè