{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,21]],"date-time":"2023-08-21T01:44:54Z","timestamp":1692582294334},"reference-count":10,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,10,3]],"date-time":"2006-10-03T00:00:00Z","timestamp":1159833600000},"content-version":"vor","delay-in-days":7702,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1985,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We prove that, with very few exceptions, every graph of order <jats:italic>n<\/jats:italic>, <jats:italic>n<\/jats:italic> \u2212 0, 1(mod 4) and size at most <jats:italic>n<\/jats:italic> \u2212 1, is contained in a self\u2010complementary graph of order <jats:italic>n.<\/jats:italic> We study a similar problem for digraphs.<\/jats:p>","DOI":"10.1002\/jgt.3190090305","type":"journal-article","created":{"date-parts":[[2007,5,29]],"date-time":"2007-05-29T07:16:41Z","timestamp":1180423001000},"page":"335-341","source":"Crossref","is-referenced-by-count":14,"title":["On self\u2010complementation"],"prefix":"10.1002","volume":"9","author":[{"given":"A.","family":"Benhocine","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. P.","family":"Wojda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,3]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190010308"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02761996"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(74)90137-X"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.21136\/CMJ.1981.101722"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(77)90157-1"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-38.1.99"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01234967"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.5486\/PMD.1962.9.3-4.11"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1155\/S0161171278000356"},{"key":"e_1_2_1_11_2","unstructured":"A. P.Wojda Grafy i digrafy samodope Iniajace. Report (1977)."}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190090305","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190090305","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190090305","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,21]],"date-time":"2023-08-21T01:21:47Z","timestamp":1692580907000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190090305"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,9]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1985,9]]}},"alternative-id":["10.1002\/jgt.3190090305"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190090305","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,9]]}}}