In the decryption of codes and ciphers, problems arise from time to ti
me which can be expressed in graph theoretical terms. In the context o
f cryptography these graph problems are usually trivial, but sometimes
, by suitable generalization, they can suggest concepts which are not
only nontrivial but which may even be of some interest. A few examples
are given.