{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T03:15:40Z","timestamp":1769829340216,"version":"3.49.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1981,6,1]],"date-time":"1981-06-01T00:00:00Z","timestamp":360201600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1981,6]]},"DOI":"10.1007\/bf02579268","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T18:16:08Z","timestamp":1174587368000},"page":"117-140","source":"Crossref","is-referenced-by-count":27,"title":["Cycles through specified vertices of a graph"],"prefix":"10.1007","volume":"1","author":[{"given":"J. A.","family":"Bondy","sequence":"first","affiliation":[]},{"given":"L.","family":"Lov\u00e1sz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02579268_CR1","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0012-365X(72)90079-9","volume":"2","author":"V. Chv\u00e1tal","year":"1972","unstructured":"V. Chv\u00e1tal andP. Erd\u0151s, A note on Hamiltonian circuits,Discrete Math. 2 (1972), 111\u2013113.","journal-title":"Discrete Math."},{"key":"BF02579268_CR2","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/mana.19600220107","volume":"22","author":"G. A. Dirac","year":"1960","unstructured":"G. A. Dirac, In abstrakten Graphen vorhandene vollst\u00e4ndige 4-Graphen und ihre Unterteilungen,Math. Nachr. 22 (1960), 61\u201385.","journal-title":"Math. Nachr."},{"key":"BF02579268_CR3","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF01349245","volume":"203","author":"G. A. Dirac","year":"1973","unstructured":"G. A. Dirac andC. Thomassen, Graphs in which every finite path is contained in a circuit,Math. Ann. 203 (1973), 65\u201375.","journal-title":"Math. Ann."},{"key":"BF02579268_CR4","unstructured":"D. A. Holton, B. D. McKay andM. D. Plummer, Cycles through specified vertices in 3-connected cubic graphs, preprint,University of Melbourne, 1979."},{"key":"BF02579268_CR5","unstructured":"J. M. Kinney andC. C. Alexander, Connectivity and traceability,preprint, 1978."},{"key":"BF02579268_CR6","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/0095-8956(73)90054-3","volume":"14","author":"D. R. Lick","year":"1973","unstructured":"D. R. Lick, Characterizations ofn-connected andn-line connected graphs,J. Combinatorial Theory Ser. B,14 (1973), 122\u2013124.","journal-title":"J. Combinatorial Theory Ser. B"},{"key":"BF02579268_CR7","first-page":"82","volume":"4","author":"L. Lov\u00e1sz","year":"1974","unstructured":"L. Lov\u00e1sz, Research problem 5,Period. Math. Hungar. 4 (1974), 82.","journal-title":"Period. Math. Hungar."},{"key":"BF02579268_CR8","first-page":"1208","volume-title":"Colloquia Mathematica Societatis J\u00e1nos Bolyai","author":"L. Lov\u00e1sz","year":"1978","unstructured":"L. Lov\u00e1sz, in vol. II ofCombinatorics (A. Hajnal and Vera T. S\u00f3s, eds.),Colloquia Mathematica Societatis J\u00e1nos Bolyai 18, North-Holland Publishing Co., New York, 1978, p. 1208."},{"key":"BF02579268_CR9","unstructured":"M. Mamoun,untitled preprint, 1979."},{"key":"BF02579268_CR10","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/0022-247X(68)90163-7","volume":"22","author":"H. Perfect","year":"1968","unstructured":"H. Perfect, Applications of Menger\u2019s graph theorem,J. Math. Anal. Appl. 22 (1968), 96\u2013111.","journal-title":"J. Math. Anal. Appl."},{"key":"BF02579268_CR11","first-page":"457","volume-title":"Proc. Second Louisiana Conf. on Combinatorics, Graph Theory, and Computing","author":"M. D. Plummer","year":"1971","unstructured":"M. D. Plummer, On path properties versus connectivity, I., inProc. Second Louisiana Conf. on Combinatorics, Graph Theory, and Computing, Louisiana State Univ., Baton Rouge, La. (1971), 457\u2013472."},{"key":"BF02579268_CR12","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0095-8956(77)90073-9","volume":"22","author":"C. Thomassen","year":"1977","unstructured":"C. Thomassen, Note on circuits containing specified edges,J. Combinatorial Theory Ser. B,22 (1977), 279\u2013280.","journal-title":"J. Combinatorial Theory Ser. B"},{"key":"BF02579268_CR13","first-page":"544","volume-title":"Recent Advances in Graph Theory","author":"B. Toft","year":"1975","unstructured":"B. Toft, Problem 11 inRecent Advances in Graph Theory (M. Fiedler and J. Bos\u00e1k, eds.), Academia, Prague, 1975, p. 544."},{"key":"BF02579268_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01837870","volume":"15","author":"W. T. Tutte","year":"1977","unstructured":"W. T. Tutte, Bridges and Hamiltonian circuits in planar graphs,Aequationes Math. 15 (1977), 1\u201333.","journal-title":"Aequationes Math."},{"key":"BF02579268_CR15","first-page":"57","volume":"23","author":"H.-J. Voss","year":"1977","unstructured":"H.-J. Voss andC. Zuluaga, Maximale gerade und ungerade Kreise in Graphen I,Wiss. Z. Tech. Hochsch. Ilmenau 23 (1977), 57\u201370.","journal-title":"Wiss. Z. Tech. Hochsch. Ilmenau"},{"key":"BF02579268_CR16","doi-asserted-by":"crossref","first-page":"1319","DOI":"10.4153\/CJM-1967-121-2","volume":"19","author":"M. E. Watkins","year":"1967","unstructured":"M. E. Watkins andD. M. Mesner, Cycles and connectivity in graphs,Canad. J. Math. 19 (1967), 1319\u20131328.","journal-title":"Canad. J. Math."},{"key":"BF02579268_CR17","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF01419587","volume":"197","author":"W. L. Wilson","year":"1972","unstructured":"W. L. Wilson, R. L. Hemminger andM. D. Plummer, A family of path properties for graphs,Math. Ann. 197 (1972), 107\u2013122.","journal-title":"Math. Ann."},{"key":"BF02579268_CR18","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/0095-8956(77)90072-7","volume":"22","author":"D. R. Woodall","year":"1977","unstructured":"D. R. Woodall, Circuits containing specified edges,J. Combinatorial Theory Ser. B 22 (1977), 274\u2013278.","journal-title":"J. Combinatorial Theory Ser. B"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579268.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02579268\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579268","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T12:45:00Z","timestamp":1558183500000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02579268"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,6]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1981,6]]}},"alternative-id":["BF02579268"],"URL":"https:\/\/doi.org\/10.1007\/bf02579268","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,6]]}}}