{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T00:50:52Z","timestamp":1695603052534},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1980,1,1]],"date-time":"1980-01-01T00:00:00Z","timestamp":315532800000},"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":12251,"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":[[1980]]},"DOI":"10.1016\/0012-365x(80)90235-6","type":"journal-article","created":{"date-parts":[[2003,1,10]],"date-time":"2003-01-10T18:08:14Z","timestamp":1042222094000},"page":"277-287","source":"Crossref","is-referenced-by-count":3,"title":["On a generalization of linecritical graphs"],"prefix":"10.1016","volume":"30","author":[{"given":"L\u00e1szl\u00f3","family":"Sur\u00e1nyi","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(80)90235-6_BIB1","series-title":"Theory of graphs. International symposium","first-page":"9","article-title":"On critical graphs","author":"Andr\u00e1sfai","year":"1967"},{"key":"10.1016\/0012-365X(80)90235-6_BIB2","first-page":"181","article-title":"On the minimal number of vertices representing the edges of a graph","author":"Erd\u00f6s","year":"1961","journal-title":"Publications of the Mathematical Institute of the Hungarian Academy of Sciences VI"},{"key":"10.1016\/0012-365X(80)90235-6_BIB3","doi-asserted-by":"crossref","first-page":"720","DOI":"10.4153\/CJM-1965-072-1","article-title":"On \u03ba-saturated graphs","volume":"17","author":"Hajnal","year":"1965","journal-title":"Canad. J. Math."},{"key":"10.1016\/0012-365X(80)90235-6_BIB4","article-title":"Some Finite basis theorems in graph theory","volume":"18","author":"Lov\u00e1sz","year":"1976"},{"key":"10.1016\/0012-365X(80)90235-6_BIB5","doi-asserted-by":"crossref","unstructured":"L. Lov\u00e1sz, On the structure of factorizable graphs. Acta Math. Acad. Sci. Hung. 23, 1\u20132, 179\u2013195","DOI":"10.1007\/BF01889914"},{"key":"10.1016\/0012-365X(80)90235-6_BIB6","first-page":"1411","article-title":"On line critical graphs","volume":"10","author":"Sur\u00e1nyi","year":"1973","journal-title":"Infinite and finite sets"},{"key":"10.1016\/0012-365X(80)90235-6_BIB7","unstructured":"L. Sur\u00e1nyi. Egy megjegyz\u00e9s az \u03b1-kritikus gr\u00e1fokr\u00f3l. Matematikai Lapok, 24, 3\u20134, 341\u2013343"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X80902356?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X80902356?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T04:21:00Z","timestamp":1583986860000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X80902356"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1980]]}},"alternative-id":["0012365X80902356"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(80)90235-6","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1980]]}}}