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