{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T00:56:17Z","timestamp":1725756977761},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642452802"},{"type":"electronic","value":"9783642452819"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45281-9_14","type":"book-chapter","created":{"date-parts":[[2013,11,18]],"date-time":"2013-11-18T07:20:12Z","timestamp":1384759212000},"page":"143-149","source":"Crossref","is-referenced-by-count":1,"title":["A Necessary and Sufficient Condition for a Bipartite Distance-Hereditary Graph to Be Hamiltonian"],"prefix":"10.1007","author":[{"given":"Masahide","family":"Takasuga","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomio","family":"Hirata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0095-8956(86)90043-2","volume":"41","author":"H.-J. Bandelt","year":"1986","unstructured":"Bandelt, H.-J., Mulder, H.M.: Distance-Hereditary Graphs. Journal of Combinatorial Theory B\u00a041, 182\u2013208 (1986)","journal-title":"Journal of Combinatorial Theory B"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00373-006-0649-0","volume":"22","author":"D. Bauer","year":"2006","unstructured":"Bauer, D., Broersma, H., Schmeichel, E.: Toughness in Graphs A Survey. Graphs and Combinatorics\u00a022, 1\u201335 (2006)","journal-title":"Graphs and Combinatorics"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/BFb0017474","volume-title":"Trees in Algebra and Programming - CAAP \u201994","author":"A. Cournier","year":"1994","unstructured":"Cournier, A., Habib, M.: A new linear algorithm for modular decomposition. In: Tison, S. (ed.) CAAP 1994. LNCS, vol.\u00a0787, pp. 68\u201384. Springer, Heidelberg (1994)"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0012-365X(73)90138-6","volume":"5","author":"V. Chv\u00e1tal","year":"1973","unstructured":"Chv\u00e1tal, V.: Tough graphs and Hamiltonian circuits. Discrete Mathematics\u00a05, 215\u2013228 (1973)","journal-title":"Discrete Mathematics"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-540-27810-8_17","volume-title":"Algorithm Theory - SWAT 2004","author":"M. Habib","year":"2004","unstructured":"Habib, M., de Montgolfier, F., Paul, C.: A simple linear-time modular decomposition algorithm for graphs, using order extension. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol.\u00a03111, pp. 187\u2013198. Springer, Heidelberg (2004)"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1016\/j.dam.2005.07.012","volume":"154","author":"S.-Y. Hsieh","year":"2006","unstructured":"Hsieh, S.-Y., Ho, C.-W., Hsu, T.-S., Ko, M.-T.: The problem on distance-hereditary graphs. Discrete Applied Mathematics\u00a0154, 508\u2013524 (2006)","journal-title":"Discrete Applied Mathematics"},{"key":"14_CR7","first-page":"827","volume":"19","author":"R.-W. Hung","year":"2003","unstructured":"Hung, R.-W., Wu, S.-C., Chang, M.-S.: Hamiltonian cycle problem on distance-hereditary graphs. Journal of Information Science and Engineering\u00a019, 827\u2013838 (2003)","journal-title":"Journal of Information Science and Engineering"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/j.tcs.2005.04.009","volume":"341","author":"R.-W. Hung","year":"2005","unstructured":"Hung, R.-W., Chang, M.-S.: Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs. Theoretical Computer Science\u00a0341, 411\u2013440 (2005)","journal-title":"Theoretical Computer Science"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0012-365X(95)00190-8","volume":"150","author":"D. Kratsch","year":"1996","unstructured":"Kratsch, D., Lehel, J., M\u00fcller, H.: Toughness, hamiltonicity and split graphs. Discrete Mathematics\u00a0150, 231\u2013245 (1996)","journal-title":"Discrete Mathematics"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.cosrev.2010.09.009","volume":"5","author":"R.M. McConnell","year":"2011","unstructured":"McConnell, R.M., Mehlhorn, K., N\u00e4her, S., Schweitzer, P.: Certifying Algorithms. Computer Science Review\u00a05, 119\u2013161 (2011)","journal-title":"Computer Science Review"},{"unstructured":"McConnell, R.M., Spinrad, J.P.: Linear-time modular decomposition and efficient transitive orientation of comparability graphs. In: Proceeding SODA, pp. 536\u2013545 (1994)","key":"14_CR11"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0020-0190(93)90100-N","volume":"46","author":"H. M\u00fcller","year":"1993","unstructured":"M\u00fcller, H., Nicolai, F.: Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs. Information Processing Letters\u00a046, 225\u2013230 (1993)","journal-title":"Information Processing Letters"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0012-365X(95)00057-4","volume":"156","author":"H. M\u00fcller","year":"1996","unstructured":"M\u00fcller, H.: Hamiltonian circuits in chordal bipartite graphs. Discrete Mathematics\u00a0156, 291\u2013298 (1996)","journal-title":"Discrete Mathematics"},{"unstructured":"Nicolai, F.: Hamiltonian problems on distance-hereditary graphs, Technique Report SM-DU-264, Gerhard-Mercator University, Germany (1994)","key":"14_CR14"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1007\/978-3-540-70575-8_52","volume-title":"Automata, Languages and Programming","author":"M. Tedder","year":"2008","unstructured":"Tedder, M., Corneil, D.G., Habib, M., Paul, C.: Simpler linear-time modular decomposition via recursive factorizing permutations. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 634\u2013645. Springer, Heidelberg (2008)"},{"key":"14_CR16","first-page":"257","volume":"19","author":"R.H. M\u00f6hring","year":"1984","unstructured":"M\u00f6hring, R.H., Radermacher, F.J.: Substitution decomposition for discrete structures and connections with combinatorial optimization. Annals of Discrete Mathematics\u00a019, 257\u2013356 (1984)","journal-title":"Annals of Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Computational Geometry and Graphs"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45281-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T05:42:18Z","timestamp":1558676538000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45281-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642452802","9783642452819"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45281-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}