Lyndon graphs are connected subgraphs of the n-cube which arise in the combinatorics of words. It is shown that these graphs are not Hamiltonian when n is even.
