{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:36:56Z","timestamp":1725482216888},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540667315"},{"type":"electronic","value":"9783540467847"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46784-x_34","type":"book-chapter","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T08:02:55Z","timestamp":1175760175000},"page":"364-376","source":"Crossref","is-referenced-by-count":0,"title":["Linear Time Algorithms for Hamiltonian Problems on (Claw,Net)\u2014Free Graphs"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Brandst\u00e4dt","sequence":"first","affiliation":[]},{"given":"Feodor F.","family":"Dragan","sequence":"additional","affiliation":[]},{"given":"Ekkehard","family":"K\u00f6hler","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1002\/(SICI)1097-0118(199610)23:2<191::AID-JGT10>3.0.CO;2-K","volume":"23","author":"A.S. Asratian","year":"1996","unstructured":"A.S. Asratian, Every 3-connected, locally connected, claw-free graph is Hamiltonconnected, J. Graph Theory, 23 (1996), 191\u2013201. 364","journal-title":"J. Graph Theory"},{"key":"34_CR2","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/S0012-365X(98)00165-4","volume":"195","author":"B. Bollob\u00e1s","year":"1999","unstructured":"B. Bollob\u00e1s, O. Riordan, Z. Ryj\u00e1\u010dek, A. Saito, and R.H. Schelp, Closure and Hamiltonian-connectivity of claw-free graphs, Discrete Math., 195 (1999) 67\u201380. 364","journal-title":"Discrete Math."},{"key":"34_CR3","unstructured":"S. Brandt, O. Favaron and Z. Ryj\u00e1\u010dek, Closure and stable hamiltonian properties in claw-free graphs, Tech. Rep. No 97, University ofWest Bohemia, November, 1996. 364"},{"key":"34_CR4","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S0012-365X(98)00334-3","volume":"196","author":"J. Brousek","year":"1999","unstructured":"J. Brousek, Z. Ryj\u00e1\u010dek and O. Favaron, Forbidden Subgraphs, Hamiltonicity and Closure in Claw-Free Graphs, Discrete Math., 196 (1999) 29\u201350. 364","journal-title":"Discrete Math."},{"key":"34_CR5","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0020-0190(95)00021-4","volume":"54","author":"D.G. Corneil","year":"1995","unstructured":"D.G. Corneil, S. Olariu and L. Stewart, A linear time algorithm to compute a dominating path in an AT-free graph, Information Processing Letters, 54 (1995), 253\u2013257. 365","journal-title":"Information Processing Letters"},{"key":"34_CR6","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1137\/S0895480193250125","volume":"10","author":"D.G. Corneil","year":"1997","unstructured":"D.G. Corneil, S. Olariu and L. Stewart, Asteroidal Triple-free Graphs, SIAM J. Discrete Math., 10 (1997), 399\u2013430. 365","journal-title":"SIAM J. Discrete Math."},{"key":"34_CR7","unstructured":"D.G. Corneil, S. Olariu and L. Stewart, Linear time algorithms for dominating pairs in asteroidal triple-free graphs, to appear in SIAM J. Computing. 365"},{"key":"34_CR8","unstructured":"P. Damaschke, Hamiltonian-hereditary graphs, unpublished. 365"},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"R. Diestel, Graph Theory, Graduate Texts in Mathematics 173, Springer, 1997. 365","DOI":"10.1007\/978-3-662-53622-3_7"},{"key":"34_CR10","unstructured":"D. Duffus, M.S. Jacobson and R.J. Gould, Forbidden Subgraphs and the Hamiltonian Theme, Proceedings, 4th Int. Conference on the Theory and Applications of Graphs, 1980, 297\u2013316. 364"},{"key":"34_CR11","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0012-365X(96)00045-3","volume":"164","author":"R.J. Faudree","year":"1997","unstructured":"R.J. Faudree, E. Flandrin and Z. Ryj\u00e1\u010dek, Claw-free graphs-a survey, Discrete Math., 164 (1997), 87\u2013147. 364","journal-title":"Discrete Math."},{"key":"34_CR12","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0012-365X(96)00147-1","volume":"173","author":"R.J. Faudree","year":"1997","unstructured":"R.J. Faudree and R.J. Gould, Characterizing forbidden pairs for hamiltonian properties, Discrete Math., 173 (1997), 45\u201360. 364","journal-title":"Discrete Math."},{"key":"34_CR13","first-page":"109","volume":"19","author":"R.J. Faudree","year":"1995","unstructured":"R.J. Faudree, Z. Ryj\u00e1\u010dek and I. Schieremyer, Forbidden subgraphs and cycle extendability, J. Combin. Math. Combin. Comput., 19 (1995), 109\u2013128. 364","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"34_CR14","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0012-365X(93)90157-O","volume":"111","author":"E. Flandrin","year":"1993","unstructured":"E. Flandrin, J.L. Fouquet and H. Li, On Hamiltonian claw-free graphs, Discrete Math., 111 (1993), 221\u2013229. 364","journal-title":"Discrete Math."},{"key":"34_CR15","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980. 365"},{"key":"34_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/3-540-52921-7_59","volume-title":"Algorithms","author":"P. Hell","year":"1990","unstructured":"P. Hell, J. Bang-jensen and J. Huang, Local Tournaments and Proper Circular Arc Graphs, Algorithms, Lecture Notes in Computer Science (T. Asano, T. Ibaraki, H. Imai, and T. Nishizeki, eds.), Vol. 450, Springer-Verlag, New-York (1990) pp. 101\u2013108. 374"},{"key":"34_CR17","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0020-0190(85)90050-X","volume":"20","author":"J. M. Keil","year":"1985","unstructured":"J. M. Keil, Finding hamiltonian circuits in interval graphs, Information Processing Letters, 20 (1985), 201\u2013206. 374","journal-title":"Information Processing Letters"},{"key":"34_CR18","unstructured":"E. K\u00f6hler, Linear time algorithms for Hamiltonian problems in claw-free AT-free graphs, manuscript, 1999. 371"},{"key":"34_CR19","unstructured":"E. K\u00f6hler and M. Kriesell, Edge-Dominating Trails in AT-free Graphs, Tech. Rep. No 615, Technical University Berlin, 1998. 364"},{"key":"34_CR20","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1002\/jgt.3190170305","volume":"17","author":"M. Li","year":"1993","unstructured":"M. Li, Hamiltonian cycles in 3-connected claw-free graphs, J. Graph Theory, 17 (1993), 303\u2013313. 364","journal-title":"J. Graph Theory"},{"key":"34_CR21","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0020-0190(90)90025-S","volume":"35","author":"G. K. Manacher","year":"1990","unstructured":"G. K. Manacher, T. A. Mankus And C. J. Smith, an Optimum \u03b8(n Log n) Algorithm For Finding A Canonical Hamiltonian Path And A Canonical Hamiltonian Circuit In A Set Of Intervals, information Processing Letters, 35 (1990), 205\u2013211. 374","journal-title":"information Processing Letters"},{"key":"34_CR22","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1006\/jctb.1996.1732","volume":"70","author":"Z. Ryj\u00e1\u010dek","year":"1997","unstructured":"Z. Ryj\u00e1\u010dek, On a closure concept in claw-free graphs, Journal of Combinatorial Theory, Series B, 70 (1997), 217\u2013224. 364","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"34_CR23","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0095-8956(91)90074-T","volume":"53","author":"F.B. Shepherd","year":"1991","unstructured":"F.B. Shepherd, Hamiltonicity in Claw-Free Graphs, Journal of Combinatorial Theory, Series B, 53 (1991), 173\u2013194. 364","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"34_CR24","unstructured":"F.B. Shepherd, Claws, Master\u2019s Thesis, University of Waterloo, 1987. 365"},{"key":"34_CR25","unstructured":"D. B. West, Introduction to Graph Theory, Prentice-Hall, 1996, (Problem 6.3.14, Chapter 6). 364"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46784-X_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T23:38:15Z","timestamp":1556321895000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46784-X_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540667315","9783540467847"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-46784-x_34","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}