  Call an edge colouring of a graph distinguishing if the only automorphism
that preserves that colouring is the identity. We prove that every locally
finite connected regular graph of order at least 7 admits a distinguishing edge
colouring with two colours.
