{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T20:38:40Z","timestamp":1774643920929,"version":"3.50.1"},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1984,2,1]],"date-time":"1984-02-01T00:00:00Z","timestamp":444441600000},"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":10759,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1984,2]]},"DOI":"10.1016\/0166-218x(84)90067-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:34Z","timestamp":1027655014000},"page":"201-208","source":"Crossref","is-referenced-by-count":9,"title":["An algorithm to recognize a middle graph"],"prefix":"10.1016","volume":"7","author":[{"given":"Miros\u0142awa","family":"Skowro\u0144ska","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maciej M.","family":"Sys\u0142o","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(84)90067-2_BIB1","first-page":"35","article-title":"On characterizations of the middle graphs","volume":"11","author":"Akiyama","year":"1975","journal-title":"TRU Mathematics"},{"key":"10.1016\/0166-218X(84)90067-2_BIB2","series-title":"Theorie der Graphen und Netzwerke","first-page":"47","article-title":"On characterizations of hypergrahs and some related results","author":"Borowiecki","year":"1979"},{"key":"10.1016\/0166-218X(84)90067-2_BIB3","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1002\/net.3230080205","article-title":"A recognition algorithm for the total graphs","volume":"8","author":"Gavril","year":"1978","journal-title":"Networks"},{"key":"10.1016\/0166-218X(84)90067-2_BIB4","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0012-365X(76)90037-6","article-title":"Traversability and connectivity of the middle graph of a graph","volume":"14","author":"Hamada","year":"1976","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(84)90067-2_BIB5","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0166-218X(84)90067-2_BIB6","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1145\/321850.321853","article-title":"An optimal algorithm to detect a line graph and output its root graph","volume":"21","author":"Lehot","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(84)90067-2_BIB7","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/0020-0190(73)90029-X","article-title":"A max {m, n} algorithm for determining the graph H from its line graph G","volume":"2","author":"Roussopoulos","year":"1973","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/0166-218X(84)90067-2_BIB8","series-title":"Report Nr. N-99","article-title":"Characterization of middle digraphs of multi- and general digraphs","author":"Skowro\u0144ska","year":"1981"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X84900672?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X84900672?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:26:44Z","timestamp":1555136804000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X84900672"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,2]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1984,2]]}},"alternative-id":["0166218X84900672"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(84)90067-2","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1984,2]]}}}