{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T17:07:12Z","timestamp":1771866432467,"version":"3.50.1"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1982,3,1]],"date-time":"1982-03-01T00:00:00Z","timestamp":383788800000},"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":[[1982,3]]},"DOI":"10.1007\/bf02579281","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T22:17:40Z","timestamp":1174601860000},"page":"53-62","source":"Crossref","is-referenced-by-count":35,"title":["A nine point theorem for 3-connected graphs"],"prefix":"10.1007","volume":"2","author":[{"given":"D. A.","family":"Holton","sequence":"first","affiliation":[]},{"given":"B. D.","family":"McKay","sequence":"additional","affiliation":[]},{"given":"M. D.","family":"Plummer","sequence":"additional","affiliation":[]},{"given":"C.","family":"Thomassen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02579281_CR1","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1017\/S144678870000639X","volume":"11","author":"A. T. Balaban","year":"1970","unstructured":"A. T. Balaban, R. O. Davies, F. Harary, A. Hill andR. Westwick, Cubic identity graphs derived from trees,J. Austral. Math. Soc.,11 (1970), 207\u2013215.","journal-title":"J. Austral. Math. Soc."},{"issue":"2","key":"BF02579281_CR2","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF02579268","volume":"1","author":"J. A. Bondy","year":"1981","unstructured":"J. A. Bondy andL. Lov\u00e1sz, Cycles through specified vertices of a graph,Combinatorica 1 (2) (1981), 117\u2013140.","journal-title":"Combinatorica"},{"key":"BF02579281_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"J. A. Bondy","year":"1976","unstructured":"J. A. Bondy andU. S. R. Murty,Graph Theory with Applications, MacMillan, London, 1976."},{"key":"BF02579281_CR4","unstructured":"F. C. Busemaker, S. Cobelji\u0107, D. M. Cvetkovi\u0107 andJ. J. Seidel, Computer investigation of cubic graphs,Technological University of Edindhoven, Mathematics Research Report WSK-01, 1976."},{"key":"BF02579281_CR5","doi-asserted-by":"crossref","first-page":"33","DOI":"10.4153\/CMB-1973-008-9","volume":"16","author":"V. Chv\u00e1tal","year":"1973","unstructured":"V. Chv\u00e1tal, Flip-flops in hypohamiltonian graphs,Canad. Math. Bull.,16 (1973), 33\u201341.","journal-title":"Canad. Math. Bull."},{"key":"BF02579281_CR6","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":"BF02579281_CR7","unstructured":"R. H\u00e4ggkvist andC. Thomassen, Circuits through specified edges,Discrete Math., to appear."},{"key":"BF02579281_CR8","unstructured":"D. A. Holton, Cycles through specified vertices ink-connected regular graphs,preprint 1980."},{"key":"BF02579281_CR9","first-page":"82","volume":"4","author":"L. Lov\u00e1sz","year":"1974","unstructured":"L. Lov\u00e1sz, Problem 5,Per. Math. Hungar.,4 (1974), 82.","journal-title":"Per. Math. Hungar."},{"key":"BF02579281_CR10","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/S0095-8956(73)80006-1","volume":"14","author":"G. H. J. Meredith","year":"1973","unstructured":"G. H. J. Meredith, Regularn-valentn-connected non-hamiltonian non-n-edge-colorable graphs,J. Combinatorial Th., B.,14 (1973), 55\u201360.","journal-title":"J. Combinatorial Th., B."},{"key":"BF02579281_CR11","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/0095-8956(81)90089-7","volume":"30","author":"C. Thomassen","year":"1981","unstructured":"C. Thomassen, Planar cubic hypohamiltonian and hypotraceable graphs,J. Combinatorial Th. B.,30 (1981), 36\u201344.","journal-title":"J. Combinatorial Th. B."},{"key":"BF02579281_CR12","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":"BF02579281_CR13","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 Th. B.,22 (1977), 274\u2013278.","journal-title":"J. Combinatorial Th. B."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579281.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02579281\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579281","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T16:45:01Z","timestamp":1558197901000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02579281"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,3]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1982,3]]}},"alternative-id":["BF02579281"],"URL":"https:\/\/doi.org\/10.1007\/bf02579281","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982,3]]}}}