{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T02:18:10Z","timestamp":1648779490737},"reference-count":8,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1984,12,1]],"date-time":"1984-12-01T00:00:00Z","timestamp":470707200000},"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":10455,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[1984,12]]},"DOI":"10.1016\/0095-8956(84)90063-7","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T14:37:08Z","timestamp":1107959828000},"page":"294-298","source":"Crossref","is-referenced-by-count":0,"title":["Maximum non-path-connected graphs"],"prefix":"10.1016","volume":"37","author":[{"given":"George R.T","family":"Hendry","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(84)90063-7_BIB1","author":"Behzad","year":"1979"},{"key":"10.1016\/0095-8956(84)90063-7_BIB2","first-page":"117","article-title":"Minimum number of edges in P3-connected graphs","volume":"20","author":"Enomoto","year":"1981","journal-title":"Utilitas Math."},{"key":"10.1016\/0095-8956(84)90063-7_BIB3","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0012-365X(73)90035-6","article-title":"Theory of path length distribution I.","volume":"6","author":"Faudree","year":"1973","journal-title":"Discrete Math."},{"key":"10.1016\/0095-8956(84)90063-7_BIB4","author":"Harary","year":"1969"},{"key":"10.1016\/0095-8956(84)90063-7_BIB5","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0095-8956(78)90001-1","article-title":"On path connected graphs","volume":"25","author":"Lewin","year":"1978","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(84)90063-7_BIB6","first-page":"21","article-title":"Hamilton-connected graphs","volume":"42","author":"Ore","year":"1963","journal-title":"J. Math. Pures Appl."},{"key":"10.1016\/0095-8956(84)90063-7_BIB7","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0012-365X(83)90060-2","article-title":"Minimum number of edges in graphs that are both P2- and Pi-connected","volume":"44","author":"Usami","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/0095-8956(84)90063-7_BIB8","first-page":"23","article-title":"Extremal P3-connected graphs","volume":"23","author":"Usami","year":"1983","journal-title":"Utilitas Math."}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895684900637?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895684900637?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T16:20:35Z","timestamp":1548778835000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895684900637"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,12]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1984,12]]}},"alternative-id":["0095895684900637"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(84)90063-7","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1984,12]]}}}