1.Previous
3.Next

the farthest point from (x, y) is (2ⁿ − x − 1, (y + n/2) mod n). showed that the crossing number of CCC_n is ((1/20) + o(1)) 4ⁿ.

According to the Lovász conjecture, the cube-connected cycle graph should always contain a Hamiltonian cycle, and this is now known to be true. More generally,

1.Previous
3.Next