%0 Journal Article
%A Paul J. Tanenbaum
%T Bound graph polysemy
%J The electronic journal of combinatorics
%D 2000
%V 7
%U http://geodesic.mathdoc.fr/articles/10.37236/1521/
%R 10.37236/1521
%F 10_37236_1521