{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T09:35:46Z","timestamp":1697967346163},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1981,2,1]],"date-time":"1981-02-01T00:00:00Z","timestamp":349833600000},"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":11854,"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":[[1981,2]]},"DOI":"10.1016\/0166-218x(81)90023-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:46:59Z","timestamp":1027640819000},"page":"9-18","source":"Crossref","is-referenced-by-count":5,"title":["Realizability of p-point graphs with prescribed minimum degree, maximum degree, and point-connectivity"],"prefix":"10.1016","volume":"3","author":[{"given":"F.T.","family":"Boesch","sequence":"first","affiliation":[]},{"given":"C.L.","family":"Suffel","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(81)90023-8_BIB1","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/TCT.1973.1083622","article-title":"Graphs with given connectivity and independence number","volume":"20","author":"Amin","year":"1973","journal-title":"IEEE Trans. Circuit Theory"},{"key":"10.1016\/0166-218X(81)90023-8_BIB2","series-title":"Large-Scale Networks","author":"Boesch","year":"1976"},{"key":"10.1016\/0166-218X(81)90023-8_BIB3","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1002\/net.3230020406","article-title":"Lower bounds on the vulnerability of a network","volume":"2","author":"Boesch","year":"1972","journal-title":"Networks"},{"key":"10.1016\/0166-218X(81)90023-8_BIB4","doi-asserted-by":"crossref","first-page":"821","DOI":"10.1109\/TCS.1976.1084161","article-title":"On minimum multigraphs with prescribed lower bounds on local line connectivities","volume":"23","author":"Boesch","year":"1976","journal-title":"IEEE Trans. Circuits and Systems"},{"key":"10.1016\/0166-218X(81)90023-8_BIB5","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1137\/0134052","article-title":"A generalization of line connectivity and optimally invulnerable graphs","volume":"34","author":"Boesch","year":"1978","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0166-218X(81)90023-8_BIB6","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1109\/TCT.1970.1083099","article-title":"On graphs of invulnerable communication nets","volume":"17","author":"Boesch","year":"1970","journal-title":"IEEE Trans. Circuit Theory"},{"key":"10.1016\/0166-218X(81)90023-8_BIB7","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1002\/net.3230020306","article-title":"A general class of invulnerable graphs","volume":"2","author":"Boesch","year":"1972","journal-title":"Networks"},{"key":"10.1016\/0166-218X(81)90023-8_BIB8","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1109\/TCT.1971.1083265","article-title":"On the minimum m-degree vulnerability criterion","volume":"18","author":"Boesch","year":"1971","journal-title":"IEEE Trans. Circuit Theory"},{"key":"10.1016\/0166-218X(81)90023-8_BIB9","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1137\/0120023","article-title":"On the invulnerability of the complete k-partite graphs","volume":"20","author":"Boesch","year":"1971","journal-title":"SIAM J. Appl. Math"},{"key":"10.1016\/0166-218X(81)90023-8_BIB10","doi-asserted-by":"crossref","first-page":"778","DOI":"10.1109\/TCS.1976.1084170","article-title":"Line removal algorithms for graphs and their degree lists","volume":"23","author":"Boesch","year":"1970","journal-title":"IEEE Trans. Circuits and Systems"},{"key":"10.1016\/0166-218X(81)90023-8_BIB11","doi-asserted-by":"crossref","unstructured":"F.T. Boesch and C.L. Suffel, Realizability of p-point graphs with prescribed minimum degree, maximum degree, and line-connectivity, J. Graph Theory (to appear).","DOI":"10.1002\/jgt.3190040404"},{"key":"10.1016\/0166-218X(81)90023-8_BIB12","series-title":"Communication, Transmission, and Transportation Networks","author":"Frank","year":"1971"},{"key":"10.1016\/0166-218X(81)90023-8_BIB13","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0166-218X(81)90023-8_BIB14","doi-asserted-by":"crossref","first-page":"1142","DOI":"10.1073\/pnas.48.7.1142","article-title":"The maximum connectivity of a graph","volume":"48","author":"Harary","year":"1962","journal-title":"Proc. Nat. Acad. of Sci. USA"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X81900238?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X81900238?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:28:41Z","timestamp":1555115321000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X81900238"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,2]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1981,2]]}},"alternative-id":["0166218X81900238"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(81)90023-8","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1981,2]]}}}