Skip to main content
. 2016 Jun 16;17:237. doi: 10.1186/s12859-016-1103-9

Fig. 1.

Fig. 1

Illustration of the gadget used in the proof of Theorem 1. Encoding a directed graph into a DBG of order 2. The directed graph G (top) admits the same words than the 2-DBG G (bottom), if we ignore the numbers