{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T13:55:12Z","timestamp":1774446912639,"version":"3.50.1"},"reference-count":8,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"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":5280,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1999,2]]},"DOI":"10.1016\/s0012-365x(99)90067-5","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:16:34Z","timestamp":1051128994000},"page":"217-223","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Bounds on the size of graphs of given order and l-connectivity"],"prefix":"10.1016","volume":"197-198","author":[{"given":"D.P.","family":"Day","sequence":"first","affiliation":[]},{"given":"Ortrud R.","family":"Oellermann","sequence":"additional","affiliation":[]},{"given":"Henda C.","family":"Swart","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(99)90067-5_BIB1","series-title":"Combinatorics and Applications","first-page":"113","article-title":"Some recent results on long cycles in tough graphs in: Graph Theory","author":"Bauer","year":"1991"},{"key":"10.1016\/S0012-365X(99)90067-5_BIB2","first-page":"1","article-title":"Generalized connectivity in graphs","volume":"2","author":"Chartrand","year":"1984","journal-title":"Bull. Bombay Math. Colloq."},{"key":"10.1016\/S0012-365X(99)90067-5_BIB3","series-title":"Graphs and Digraphs","author":"Chartrand","year":"1986"},{"key":"10.1016\/S0012-365X(99)90067-5_BIB4","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0012-365X(73)90138-6","article-title":"Tough graphs and Hamilton circuits","volume":"5","author":"Chv\u00e1tal","year":"1973","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(99)90067-5_BIB5","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1080\/16073606.1990.9631613","article-title":"On the toughness of a graph","volume":"13","author":"Goddard","year":"1990","journal-title":"Quaestiones Math."},{"key":"10.1016\/S0012-365X(99)90067-5_BIB6","first-page":"1142","article-title":"The maximum connectivity of a graph","volume":"48","author":"Harary","year":"1962"},{"key":"10.1016\/S0012-365X(99)90067-5_BIB7","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF01788551","article-title":"On the \u2113-connectivity of a graph","volume":"3","author":"Oellermann","year":"1987","journal-title":"Graphs Combin."},{"key":"10.1016\/S0012-365X(99)90067-5_BIB8","first-page":"225","article-title":"On the toughness of a graph","volume":"vol. 303","author":"Pippert","year":"1972"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X99900675?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X99900675?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T04:22:08Z","timestamp":1553228528000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X99900675"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":8,"alternative-id":["S0012365X99900675"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(99)90067-5","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,2]]}}}