{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T06:40:40Z","timestamp":1698043240956},"reference-count":6,"publisher":"Wiley","issue":"5","license":[{"start":{"date-parts":[[2006,10,6]],"date-time":"2006-10-06T00:00:00Z","timestamp":1160092800000},"content-version":"vor","delay-in-days":5818,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1990,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We describe an algorithm for cataloging graphs by generating them uniformly at random. The method used is based on a recent algorithm by Dixon and Wilf that generates orbit representatives uniformly at random. The approach is refined to graphs with prescribed numbers of edges and vertices, and then applied to obtain the complete list of graphs on 10 vertices.<\/jats:p>","DOI":"10.1002\/jgt.3190140507","type":"journal-article","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T12:50:45Z","timestamp":1180183845000},"page":"559-563","source":"Crossref","is-referenced-by-count":4,"title":["Cataloging graphs by generating them uniformly at random"],"prefix":"10.1002","volume":"14","author":[{"given":"A.","family":"Kerber","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Laue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Hager","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W.","family":"Weber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,6]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190090417"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(83)90021-4"},{"key":"e_1_2_1_4_2","volume-title":"Graphical Enumeration","author":"Harary F.","year":"1973"},{"key":"e_1_2_1_5_2","first-page":"235","article-title":"Symmetrieklassen von Funktionen und ihre Abz\u00e4hlungstheorie (Teil I: Die Grundprobleme)","volume":"12","author":"Kerber A.","year":"1983","journal-title":"Bayreuther Math. Schr."},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1021\/c160017a018"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190050208"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190140507","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190140507","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T19:06:08Z","timestamp":1698001568000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190140507"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,11]]},"references-count":6,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1990,11]]}},"alternative-id":["10.1002\/jgt.3190140507"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190140507","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,11]]}}}