The Good-de Bruijn graph was originally defined to settle a question of existence of a certain shift register sequence, namely a binary cycle of length 2’n containing each of the different binary n-tuples. The further properties of the graph have been studied by several authors. Because the graph is non-planar and fairly complicated to draw for longer shift register lengths there have been several attemps to improve the description of the graph. The paper details several of these attempts. Each description has its positive and negative features. Most assuredly each possible description of the graph illustrates some features and hides others. As the de Bruijn graph possesses dozens of interesting properties, each different presentation will have its own advantages. Finally, while considering an esoteric property that the graph possess, the ultimate depiction of the graph, in the author’s view, has emerged. This version of the de Bruijn graph is the primary subject of the paper.
