{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T19:45:53Z","timestamp":1649187953049},"reference-count":13,"publisher":"Informa UK Limited","issue":"1-2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Computer Mathematics"],"published-print":{"date-parts":[[1997,1]]},"DOI":"10.1080\/00207169708804573","type":"journal-article","created":{"date-parts":[[2007,6,26]],"date-time":"2007-06-26T00:21:43Z","timestamp":1182817303000},"page":"35-46","source":"Crossref","is-referenced-by-count":1,"title":["On complete systems of invariants for small graphs"],"prefix":"10.1080","volume":"64","author":[{"given":"Frank","family":"Harary","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stavros D.","family":"Nikolopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1137\/0110037"},{"key":"CIT0002","doi-asserted-by":"crossref","first-page":"477","DOI":"10.21136\/CPM.1955.108220","volume":"80","author":"Havel V.","year":"1955","journal-title":"Casopis Pest. Mat."},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1955-0068198-2"},{"key":"CIT0004","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"Harary F.","year":"1969"},{"key":"CIT0005","volume-title":"Graphical Enumeration","author":"Harary F.","year":"1973"},{"key":"CIT0006","unstructured":"Harary, F. and Nikolopoulos, S.D. 1995.DSP\u203295: International Conference on Digital Signal Processing. Graph Isomorphism Problem for Small Graphs. 1995. pp.280\u2013286. Limassol"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(79)90004-8"},{"key":"CIT0008","unstructured":"Nikolopoulos, S.D. 1995.4th Twente Workshop on Graphs and Combinatorial Optimization. Recognition properties for some classes of perfect graphs. 1995, Enschede. pp.198\u2013203."},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)00233-O"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.2307\/2372318"},{"key":"CIT0011","volume-title":"Chemical Graph Theory","author":"Trinajstic N.","year":"1969"},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190010410"},{"key":"CIT0013","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0333-9","volume-title":"The Graph Isomorphism Problem: Its Structural Complexity","author":"K\u00f6bler J.","year":"1993"}],"container-title":["International Journal of Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207169708804573","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,16]],"date-time":"2021-08-16T02:55:00Z","timestamp":1629082500000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/00207169708804573"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,1]]},"references-count":13,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,1]]}},"alternative-id":["10.1080\/00207169708804573"],"URL":"https:\/\/doi.org\/10.1080\/00207169708804573","relation":{},"ISSN":["0020-7160","1029-0265"],"issn-type":[{"value":"0020-7160","type":"print"},{"value":"1029-0265","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,1]]}}}