{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T22:55:22Z","timestamp":1648940122266},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2006,7]]},"DOI":"10.1017\/s0963548305007443","type":"journal-article","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T09:34:36Z","timestamp":1149672876000},"page":"605","source":"Crossref","is-referenced-by-count":2,"title":["Weakly 3-Connected Graphs"],"prefix":"10.1017","volume":"15","author":[{"given":"DONALD K.","family":"WAGNER","sequence":"first","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2006,6,7]]},"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548305007443","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,4,21]],"date-time":"2017-04-21T17:08:50Z","timestamp":1492794530000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.journals.cambridge.org\/abstract_S0963548305007443"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6,7]]},"references-count":0,"journal-issue":{"issue":"04","published-print":{"date-parts":[[2006,7]]}},"URL":"https:\/\/doi.org\/10.1017\/s0963548305007443","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,6,7]]}}}