{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T00:18:13Z","timestamp":1648685893264},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1997,12,1]],"date-time":"1997-12-01T00:00:00Z","timestamp":880934400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[1997,12]]},"DOI":"10.1007\/bf03353014","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T07:47:53Z","timestamp":1403596073000},"page":"359-367","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Recognizing Intersection Graphs of Linear Uniform Hypergraphs"],"prefix":"10.1007","volume":"13","author":[{"given":"Michael S.","family":"Jacobson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9 E.","family":"K\u00e9zdy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jen\u0151","family":"Lehel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,6,17]]},"reference":[{"key":"BF03353014_CR1","first-page":"17","volume-title":"Beitr\u00e4ge zur Graphentheorie","author":"LW Beineke","year":"1968","unstructured":"Beineke, L.W.: On derived graphs and digraphs. In: H. Saks et al.: Beitr\u00e4ge zur Graphentheorie pp. 17\u201323 Leipzig: Teubner, 1968"},{"key":"BF03353014_CR2","volume-title":"Graphs and Hypergraphs","author":"C Berge","year":"1973","unstructured":"Berge, C., Graphs and Hypergraphs. London: North-Holland 1973"},{"key":"BF03353014_CR3","volume-title":"Hypergraphs, Combinatorics of Finite Sets","author":"C Berge","year":"1989","unstructured":"Berge, C., Hypergraphs, Combinatorics of Finite Sets. Amsterdam: North-Holland 1989"},{"key":"BF03353014_CR4","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0012-365X(77)90127-3","volume":"18","author":"JC Bermond","year":"1977","unstructured":"Bermond, J.C., Heydemann, M.C., Sotteau, D.: Line graphs of hypergraphs I. Discrete Math. 18, 235\u2013241 (1977)","journal-title":"Discrete Math"},{"key":"BF03353014_CR5","first-page":"567","volume":"18","author":"MC Heydemann","year":"1976","unstructured":"Heydemann, M.C., Sotteau, D.: Line graphs of hypergraphs II. Colloq. Math. Soc. J. Bolyai 18, 567\u2013582 (1976)","journal-title":"Colloq. Math. Soc. J. Bolyai"},{"key":"BF03353014_CR6","unstructured":"Jacobson, M.S., K\u00e9zdy, A.E., Lehel, J.: Intersection graphs associated with uniform hypergraphs, submitted for publication."},{"key":"BF03353014_CR7","unstructured":"Jacobson, M.S., K\u00e9zdy, A.E., Lehel, J.: Recognizing triangle-free graphs with induced path-cycle double covers is NP-complete, submitted for publication."},{"key":"BF03353014_CR8","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0195-6698(82)80029-2","volume":"3","author":"RN Naik","year":"1982","unstructured":"Naik, R.N., Rao, S.B., Shrikhande, S.S., Singhi, N.M.: Intersection graphs of k-uniform linear hypergraphs. Europ. J. Combinatorics 3, 159\u2013172 (1982)","journal-title":"Europ. J. Combinatorics"},{"key":"BF03353014_CR9","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/0020-0190(73)90029-X","volume":"2","author":"ND Roussopoulos","year":"1973","unstructured":"Roussopoulos, N.D.: A max {m, n} algorithm for determining the graph H from its line graph G. Inform. Process. Lett. 2, 108\u2013112 (1973)","journal-title":"Inform. Process. Lett"},{"key":"BF03353014_CR10","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF01904834","volume":"16","author":"ACM Rooij van","year":"1965","unstructured":"van Rooij, A.C.M., Wilf, H.S.: The interchange graph of a finite graph. Acta Math. Acad. Sci. Hungar. 16 263\u2013269 (1965)","journal-title":"Acta Math. Acad. Sci. Hungar"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03353014.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF03353014\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03353014","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T10:52:33Z","timestamp":1558522353000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF03353014"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,12]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1997,12]]}},"alternative-id":["BF03353014"],"URL":"https:\/\/doi.org\/10.1007\/bf03353014","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,12]]}}}