{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,4]],"date-time":"2025-10-04T18:31:44Z","timestamp":1759602704529},"reference-count":7,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1982,1,1]],"date-time":"1982-01-01T00:00:00Z","timestamp":378691200000},"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":11520,"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":[[1982]]},"DOI":"10.1016\/0012-365x(82)90299-0","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T11:17:01Z","timestamp":1034075821000},"page":"317-322","source":"Crossref","is-referenced-by-count":16,"title":["When m vertices in a k-connected graph cannot be walked round along a simple cycle"],"prefix":"10.1016","volume":"38","author":[{"given":"A.K.","family":"Kelmans","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.V.","family":"Lomonosov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(82)90299-0_BIB1","first-page":"1","article-title":"4-chrome Graphen und vollst\u00e4ndige 4-Graphen","volume":"22","author":"Dirac","year":"1960","journal-title":"Math. Nachr."},{"key":"10.1016\/0012-365X(82)90299-0_BIB2","series-title":"Flows in Networks","author":"Ford","year":"1962"},{"key":"10.1016\/0012-365X(82)90299-0_BIB3","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0012-365X(82)90299-0_BIB4","article-title":"On the maximal number of disjoint chains connecting given terminals in a graph","author":"Kelmans","year":"1981","journal-title":"San Francisco Annual Meeting of the AMS"},{"issue":"5","key":"10.1016\/0012-365X(82)90299-0_BIB5","first-page":"3","article-title":"Is there a walk around m given vertices in a k-connected graph?","volume":"9","author":"Kelmans","year":"1980","journal-title":"G.T.N."},{"key":"10.1016\/0012-365X(82)90299-0_BIB6","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1090\/S0002-9947-1956-0081471-8","article-title":"A theorem on planar graphs","volume":"8","author":"Tutte","year":"1956","journal-title":"Trans. Am. Math. Soc."},{"key":"10.1016\/0012-365X(82)90299-0_BIB7","unstructured":"A. Holton, B.D. Mckay, M.D. Plummer and C. Thomassen, Cycles through specified vertices, in 3-connected graphs, to be published."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X82902990?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X82902990?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T08:21:51Z","timestamp":1554884511000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X82902990"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982]]},"references-count":7,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1982]]}},"alternative-id":["0012365X82902990"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(82)90299-0","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1982]]}}}