Tanenbaum, P. J. (2000) “Bound Graph Polysemy ”, The Electronic Journal of Combinatorics, 7(1), p. R43. doi: 10.37236/1521.