{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T20:27:40Z","timestamp":1768595260868,"version":"3.49.0"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1983,10,1]],"date-time":"1983-10-01T00:00:00Z","timestamp":433814400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1983,10]]},"DOI":"10.1007\/bf02591867","type":"journal-article","created":{"date-parts":[[2007,3,29]],"date-time":"2007-03-29T15:38:47Z","timestamp":1175182727000},"page":"287-294","source":"Crossref","is-referenced-by-count":83,"title":["Halin graphs and the travelling salesman problem"],"prefix":"10.1007","volume":"26","author":[{"given":"G.","family":"Cornu\u00e9jols","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Naddef","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W. R.","family":"Pulleyblank","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02591867_CR1","series-title":"Discussion paper no. 8212","volume-title":"The travelling salesman problem in graphs with 3-edge cutsets","author":"G. Cornu\u00e9jols","year":"1982","unstructured":"G. Cornu\u00e9jols, D. Naddef and W.R. Pulleyblank, \u201cThe travelling salesman problem in graphs with 3-edge cutsets\u201d, Discussion paper no. 8212, Centre for Operations Research and Econometrics (Louvain-la-Neuve 1982)."},{"key":"BF02591867_CR2","first-page":"89","volume-title":"Combinatorial structures and their applications","author":"J. Edmonds","year":"1970","unstructured":"J. Edmonds and E.L. Johnson \u201cMatching: a well-solved class of integer programs\u201d, in R.K. Guy et al., eds.,Combinatorial structures and their applications (Gordon and Breach, New York, 1970) pp. 89\u201392."},{"key":"BF02591867_CR3","volume-title":"Polyedrische Charakterisierungen kombinatorischer Optimierungsprobleme","author":"M. Gr\u00f6tschel","year":"1977","unstructured":"M. Gr\u00f6tschel,Polyedrische Charakterisierungen kombinatorischer Optimierungsprobleme (Verlag Anton Hain, Meisenheim am Glan, 1977)."},{"key":"BF02591867_CR4","first-page":"129","volume-title":"Combinatorial mathematics, and its applications","author":"R. Halin","year":"1971","unstructured":"R. Halin, \u201cStudies on minimallyn-connected graphs\u201d, in D.J.A. Welsh, ed.,Combinatorial mathematics, and its applications (Academic Press, New York 1971) pp. 129\u2013136."},{"key":"BF02591867_CR5","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1112\/plms\/s3-30.2.160","volume":"30","author":"L. Lov\u00e1sz","year":"1975","unstructured":"L. Lov\u00e1sz and M. Plummer, \u201cOn a family of planar bicritical graphs\u201d,Proceedings of the London Mathematical Society 30 (1975) 160\u2013176.","journal-title":"Proceedings of the London Mathematical Society"},{"key":"BF02591867_CR6","first-page":"241","volume":"16","author":"D. Naddef","year":"1982","unstructured":"D. Naddef and W.R. Pulleyblank, \u201cEar decompositions of elementary graphs and GF2-rank of perfect matchings\u201d,Annals of Discrete Mathematics 16 (1982) 241\u2013260.","journal-title":"Annals of Discrete Mathematics"},{"key":"BF02591867_CR7","series-title":"RR210, 1MAG","volume-title":"The matching rank of Halin graphs","author":"W.R. Pulleyblank","year":"1980","unstructured":"W.R. Pulleyblank, \u201cThe matching rank of Halin graphs\u201d, RR210, 1MAG, Universit\u00e9 Scientifique et M\u00e9dicale de Grenoble, France (1980)."},{"key":"BF02591867_CR8","unstructured":"M. Syslo and A. Proskurowski, \u201cOn Halin graphs\u201d, to appear inProceedings of the Tagow Conference dedicated to the memory of R. Kuratowski (1981)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02591867.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02591867\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02591867","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T23:37:50Z","timestamp":1558395470000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02591867"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,10]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1983,10]]}},"alternative-id":["BF02591867"],"URL":"https:\/\/doi.org\/10.1007\/bf02591867","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983,10]]}}}