{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:08:08Z","timestamp":1763467688380},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1977,8,1]],"date-time":"1977-08-01T00:00:00Z","timestamp":239241600000},"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":13134,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[1977,8]]},"DOI":"10.1016\/0095-8956(77)90062-4","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T14:37:08Z","timestamp":1107959828000},"page":"127-138","source":"Crossref","is-referenced-by-count":37,"title":["On minimal elementary bipartite graphs"],"prefix":"10.1016","volume":"23","author":[{"given":"L","family":"Lov\u00e1sz","sequence":"first","affiliation":[]},{"given":"M.D","family":"Plummer","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(77)90062-4_BIB1","first-page":"204","article-title":"Minimally 2-connected graphs","volume":"228","author":"Dirac","year":"1967","journal-title":"J. Reine Angew. Math."},{"key":"10.1016\/0095-8956(77)90062-4_BIB2","author":"Harary","year":"1969"},{"key":"10.1016\/0095-8956(77)90062-4_BIB3","first-page":"351","article-title":"2 \u00d7 1-es t\u00e9glalapokkal lefedhet\u00f6 idomokr\u00f6l","author":"Hetyei","year":"1964","journal-title":"P\u00e9csi Tan\u00e1rk\u00e9pz\u00f6 F\u00f6isk. Tud. K\u00f6zl."},{"key":"10.1016\/0095-8956(77)90062-4_BIB4","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1017\/S144678870002913X","article-title":"A theorem on connected graphs in which every edge belongs to a 1-factor","volume":"18","author":"Little","year":"1974","journal-title":"J. Austral. Math. Soc."},{"key":"10.1016\/0095-8956(77)90062-4_BIB5","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF01889914","article-title":"On the structure of factorizable graphs","volume":"23","author":"Lov\u00e1sz","year":"1972","journal-title":"Acta Math. Hung."},{"key":"10.1016\/0095-8956(77)90062-4_BIB6","series-title":"Infinite and Finite Sets","first-page":"1051","article-title":"On bicritical graphs","author":"Lov\u00e1sz","year":"1975"},{"key":"10.1016\/0095-8956(77)90062-4_BIB7","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1090\/S0002-9947-1968-0228369-8","article-title":"On minimal blocks","volume":"134","author":"Plummer","year":"1968","journal-title":"Trans. Amer. Math. Soc."}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895677900624?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895677900624?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T16:27:03Z","timestamp":1548779223000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895677900624"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977,8]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1977,8]]}},"alternative-id":["0095895677900624"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(77)90062-4","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1977,8]]}}}