{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T21:10:56Z","timestamp":1698009056850},"reference-count":3,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,3]],"date-time":"2006-10-03T00:00:00Z","timestamp":1159833600000},"content-version":"vor","delay-in-days":7521,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1986,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A graph <jats:italic>G<\/jats:italic> is said to be decomposable if <jats:italic>G<\/jats:italic> can be decomposed into a cartesian product of two nontrivial graphs. <jats:italic>G<\/jats:italic> is bidecomposable if not only <jats:italic>G<\/jats:italic> but also its complement <jats:styled-content>G<\/jats:styled-content> is decomposable. We prove that there are only six bidecomposable graphs; 2<jats:italic>K<\/jats:italic>(2), <jats:italic>C<\/jats:italic><jats:sub>4<\/jats:sub>, <jats:styled-content>Q<\/jats:styled-content><jats:sub>3<\/jats:sub>, <jats:italic>K<\/jats:italic>(2) \u00d7(<jats:italic>K<\/jats:italic>(2) + <jats:styled-content><jats:italic>K<\/jats:italic>(2))<\/jats:styled-content>, <jats:italic>K<\/jats:italic>(3) \u00d7 <jats:italic>K<\/jats:italic>(3).<\/jats:p>","DOI":"10.1002\/jgt.3190100114","type":"journal-article","created":{"date-parts":[[2007,5,29]],"date-time":"2007-05-29T08:43:23Z","timestamp":1180428203000},"page":"117-121","source":"Crossref","is-referenced-by-count":1,"title":["The six bidecomposable graphs"],"prefix":"10.1002","volume":"10","author":[{"given":"Kiyoshi","family":"Ando","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hirobumi","family":"Mizuno","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","unstructured":"K.Ando Y.Egawa andH.Mizuno A graph and its complement being semidecomposable. Submitted."},{"key":"e_1_2_1_3_2","volume-title":"Graphs and Digraphs","author":"Behzad M.","year":"1979"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.21236\/AD0705364"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190100114","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190100114","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T22:56:11Z","timestamp":1697928971000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190100114"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,3]]},"references-count":3,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1986,3]]}},"alternative-id":["10.1002\/jgt.3190100114"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190100114","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,3]]}}}