{"content":[{"text":"The Enumeration of Labeled Graphs","bbox":{"left":0.363644,"top":0.18352,"width":0.384817,"height":0.025259000000000004}},{"text":"by Number of Cutpoints","bbox":{"left":0.431536,"top":0.228974,"width":0.24989900000000004,"height":0.025258999999999976}},{"text":"WPI-CS-TR-97-01","bbox":{"left":0.454442,"top":0.319884,"width":0.19430000000000003,"height":0.025258999999999976}},{"text":"Stanley M. Selkow*","bbox":{"left":0.450026,"top":0.365636,"width":0.203617,"height":0.026224000000000025}},{"text":"Computer Science Department \n Worcester Polytechnic Institute \n Worcester, MA 01609 USA \n email: sms@wpi.edu","bbox":{"left":0.39421,"top":0.412056,"width":0.34332999999999997,"height":0.09013000000000004}},{"text":"* Much of this work was done at the Département d’Informatique, \n Université de Marne-la-Vallée, Noisy-le-Grand, France","bbox":{"left":0.169935,"top":0.726747,"width":0.585969,"height":0.040589999999999904}},{"text":"1","bbox":{"left":0.45915,"top":0.939316,"width":0.008504000000000012,"height":0.016237999999999975}}],"images_bbox":[],"images_bbox_not_text_overlap":[]}