{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T02:39:58Z","timestamp":1648607998285},"reference-count":10,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"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":11155,"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":[[1983]]},"DOI":"10.1016\/0012-365x(83)90251-0","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T11:17:01Z","timestamp":1034075821000},"page":"183-189","source":"Crossref","is-referenced-by-count":2,"title":["On cycles through prescribed vertices in weakly separable graphs"],"prefix":"10.1016","volume":"46","author":[{"given":"A.K.","family":"Kelmans","sequence":"first","affiliation":[]},{"given":"M.V.","family":"Lomonosov","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(83)90251-0_BIB1","doi-asserted-by":"crossref","first-page":"431","DOI":"10.2140\/pjm.1961.11.431","article-title":"On the graph structure of convex polyedra in n-space","volume":"11","author":"Balinski","year":"1961","journal-title":"Pacific J. Math."},{"key":"10.1016\/0012-365X(83)90251-0_BIB2","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1002\/mana.19600220106","article-title":"4-chrome Graphen und volstandige 4-Graphen","volume":"22","author":"Dirac","year":"1960","journal-title":"Math. Nachr."},{"key":"10.1016\/0012-365X(83)90251-0_BIB3","series-title":"Abstract, San Francisco Annual Meeting of the AMS","article-title":"On the maximal number of disjoint chains connecting given terminals in a graph","author":"Kelmans","year":"1981"},{"key":"10.1016\/0012-365X(83)90251-0_BIB4","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0012-365X(82)90299-0","article-title":"When m vertices in a k-connected graph cannot be walked round along a simple cycle","volume":"38","author":"Kelmans","year":"1982","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(83)90251-0_BIB5","series-title":"Proc. Sixth Hungarian Colloq. Combinatorics (Problems)","article-title":"Problems on cycles through prescribed vertices in a graph","author":"Kelmans","year":"1981"},{"key":"10.1016\/0012-365X(83)90251-0_BIB6","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/0095-8956(80)90066-0","article-title":"Matroid matching and some applications","volume":"(B) 28","author":"Lov\u00e1sz","year":"1980","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0012-365X(83)90251-0_BIB7","series-title":"\u00dcber die Maximalzahl kreuzunsfreier H-wege","author":"Mader","year":"1978"},{"key":"10.1016\/0012-365X(83)90251-0_BIB8","series-title":"Abstracts of papers, 1981 Internat. Conf. Convexity and Graph Theory","article-title":"Some recent result on cycle traversability in graphs","author":"Mummer","year":"1981"},{"key":"10.1016\/0012-365X(83)90251-0_BIB9","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/0095-8956(73)90029-4","article-title":"Circuits and paths through specified nodes","volume":"15","author":"Sallee","year":"1973","journal-title":"J. Combin. Theory (B)"},{"key":"10.1016\/0012-365X(83)90251-0_BIB10","doi-asserted-by":"crossref","first-page":"1319","DOI":"10.4153\/CJM-1967-121-2","article-title":"Cycles and connectivity in graphs","volume":"19","author":"Watkins","year":"1967","journal-title":"Canad. J. Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X83902510?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X83902510?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T10:51:07Z","timestamp":1554893467000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X83902510"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1983]]}},"alternative-id":["0012365X83902510"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(83)90251-0","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1983]]}}}