{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T09:04:46Z","timestamp":1777539886646,"version":"3.51.4"},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"2-4","license":[{"start":{"date-parts":[[1994,6,1]],"date-time":"1994-06-01T00:00:00Z","timestamp":770428800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[1994,6]]},"DOI":"10.1007\/bf02986685","type":"journal-article","created":{"date-parts":[[2008,11,13]],"date-time":"2008-11-13T01:52:30Z","timestamp":1226541150000},"page":"353-361","source":"Crossref","is-referenced-by-count":3,"title":["Neighbourhood-Perfect Line Graphs"],"prefix":"10.1007","volume":"10","author":[{"given":"Jen\u00f6","family":"Lehel\u2020","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02986685_CR1","unstructured":"Berge, Graphs and Hypergraphs, North Holland, 1973"},{"key":"BF02986685_CR2","unstructured":"Gy\u00e1rf\u00e1s, ?., Kratsch, D., Lehel, J., Maffray, F.; Minimal non-neighbourhood-perfect graphs (submitted)"},{"key":"BF02986685_CR3","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0012-365X(86)90031-2","volume":"61","author":"J. Lehel","year":"1986","unstructured":"Lehel, J., Tuza, Zs.; Neighborhood-perfect graphs. Discrete Math. 61, 93\u2013101 (1986)","journal-title":"Discrete Math"},{"key":"BF02986685_CR4","doi-asserted-by":"crossref","unstructured":"Maffray, F.; Kernels in perfect line-graphs. J. Comb. Theory 55 (1992)","DOI":"10.1016\/0095-8956(92)90028-V"},{"key":"BF02986685_CR5","unstructured":"Neeralagi, P.S., Sampathkumar, E.; The neighbourhood number of a graph (manuscript, 1984)"},{"key":"BF02986685_CR6","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01593791","volume":"12","author":"L.E Trotter","year":"1977","unstructured":"Trotter, L.E.; Line perfect graphs. Math. Programming 12, 255\u2013259 (1977)","journal-title":"Math. Programming"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02986685.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02986685\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02986685","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T23:48:45Z","timestamp":1558568925000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02986685"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,6]]},"references-count":6,"journal-issue":{"issue":"2-4","published-print":{"date-parts":[[1994,6]]}},"alternative-id":["BF02986685"],"URL":"https:\/\/doi.org\/10.1007\/bf02986685","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,6]]}}}