{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T06:45:27Z","timestamp":1760078727086},"reference-count":9,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1979,1,1]],"date-time":"1979-01-01T00:00:00Z","timestamp":283996800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":12616,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1979]]},"DOI":"10.1016\/0012-365x(79)90103-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:33:13Z","timestamp":1027639993000},"page":"111-116","source":"Crossref","is-referenced-by-count":4,"title":["On the cyclomatic number of a hypergraph"],"prefix":"10.1016","volume":"27","author":[{"given":"B.D.","family":"Acharya","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(79)90103-1_BIB1","unstructured":"B.D. Acharya and M. Las Vergnas, On the cyclomatic number of a hypergraph: II, to appear."},{"key":"10.1016\/0012-365X(79)90103-1_BIB2","unstructured":"B.D. Acharya, Representations of hypergraphs by families of sets with given properties, to appear."},{"key":"10.1016\/0012-365X(79)90103-1_BIB3","series-title":"Graphs and hypergraphs","author":"Berge","year":"1973"},{"issue":"No. XV","key":"10.1016\/0012-365X(79)90103-1_BIB4","first-page":"53","article-title":"Graph decompositions and G-designs","author":"Bermond","year":"1976","journal-title":"Congressus Numerantium"},{"issue":"3","key":"10.1016\/0012-365X(79)90103-1_BIB5","first-page":"315","article-title":"Designs and multigraphs","volume":"37","author":"Bose","year":"1975","journal-title":"Sankhya, Ser. A"},{"key":"10.1016\/0012-365X(79)90103-1_BIB6","article-title":"Graphoids and social group structures","author":"Capobianco","year":"1973","journal-title":"MTH-3, Res. Rept. of St. John's Univ."},{"key":"10.1016\/0012-365X(79)90103-1_BIB7","author":"Harary","year":"1972"},{"key":"10.1016\/0012-365X(79)90103-1_BIB8","article-title":"Colorings of Hypergraphs","author":"Jones","year":"1976"},{"issue":"1","key":"10.1016\/0012-365X(79)90103-1_BIB9","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0095-8956(76)90070-8","article-title":"On hypergraphs without significant cycles","volume":"20","author":"Lewin","year":"1976","journal-title":"J. Combinatorial Theory, Ser. B"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X79901031?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X79901031?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T07:23:17Z","timestamp":1555140197000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X79901031"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1979]]}},"alternative-id":["0012365X79901031"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(79)90103-1","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1979]]}}}