Key points are not available for this paper at this time.
Three-periodic nets are connected graphs which permit embeddings having a threefold periodicity. To many crystal structures such nets can be meaningfully assigned and used to express the topology of the structures. It is shown that such a net can be fully characterized by a finite graph in which the edges are labelled in a suitable way. The reversal of the process of assigning a labelled finite graph to a given net can be used to generate nets of real and hypothetical crystal structures in a systematic fashion.
Chung et al. (Sun,) studied this question.