{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T03:38:26Z","timestamp":1780544306058,"version":"3.54.1"},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1995,7,1]],"date-time":"1995-07-01T00:00:00Z","timestamp":804556800000},"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":6591,"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":[[1995,7]]},"DOI":"10.1016\/0166-218x(94)00011-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:02:29Z","timestamp":1027634549000},"page":"133-153","source":"Crossref","is-referenced-by-count":28,"title":["Large planar graphs with given diameter and maximum degree"],"prefix":"10.1016","volume":"61","author":[{"given":"M.","family":"Fellows","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"P.","family":"Hell","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"K.","family":"Seyffarth","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(94)00011-2_BIB1","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1016\/0743-7315(86)90008-0","article-title":"Strategies for interconnection networks: some methods from graph theory","volume":"3","author":"Bermond","year":"1986","journal-title":"J Parallel Distributed Comput."},{"key":"10.1016\/0166-218X(94)00011-2_BIB2","series-title":"DAMIN, Special double volume on interconnection networks","volume":"37","year":"1992"},{"key":"10.1016\/0166-218X(94)00011-2_BIB3","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1002\/jgt.3190090304","article-title":"Large bipartite graphs with given degree and diameter","volume":"9","author":"Delorme","year":"1985","journal-title":"J. Graph Theory"},{"key":"10.1016\/0166-218X(94)00011-2_BIB4","unstructured":"M. Fellows, P. Hell and K. Seyffarth, Constructions of dense planar networks, preprint."},{"key":"10.1016\/0166-218X(94)00011-2_BIB5","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0012-365X(93)90166-Q","article-title":"Largest planar graphs of diameter two and fixed maximum degree","volume":"111","author":"Hell","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(94)00011-2_BIB6","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/0136016","article-title":"A separator theorem for planar graphs","volume":"36","author":"Lipton","year":"1979","journal-title":"SIAM J. Appl. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94000112?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94000112?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T23:55:31Z","timestamp":1555286131000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X94000112"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,7]]}},"alternative-id":["0166218X94000112"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(94)00011-2","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1995,7]]}}}