{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T01:52:00Z","timestamp":1673142720166},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,2,23]],"date-time":"2010-02-23T00:00:00Z","timestamp":1266883200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2010,3]]},"DOI":"10.1007\/s00373-010-0903-3","type":"journal-article","created":{"date-parts":[[2010,2,21]],"date-time":"2010-02-21T22:31:37Z","timestamp":1266791497000},"page":"187-205","source":"Crossref","is-referenced-by-count":2,"title":["A k-Tree Containing Specified Vertices"],"prefix":"10.1007","volume":"26","author":[{"given":"Shuya","family":"Chiba","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryota","family":"Matsubara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenta","family":"Ozeki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masao","family":"Tsugaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,2,23]]},"reference":[{"key":"903_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0012-365X(00)00425-8","volume":"236","author":"M.E.K. Abderrezzak","year":"2001","unstructured":"Abderrezzak M.E.K., Flandrin E., Amar D.: Cyclability and pancyclability in bipartite graphs. Discrete Math. 236, 3\u201311 (2001)","journal-title":"Discrete Math."},{"key":"903_CR2","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF01303200","volume":"13","author":"B. Bollob\u00e1s","year":"1993","unstructured":"Bollob\u00e1s B., Brightwell G.: Cycles through specified vertices. Combinatorica 13, 147\u2013155 (1993)","journal-title":"Combinatorica"},{"key":"903_CR3","volume-title":"Basic graph theory\u2014paths and circuits. Handbook of Combinatorics, vol. I, pp. 5\u2013110","author":"J.A. Bondy","year":"1995","unstructured":"Bondy, J.A.: Basic graph theory\u2014paths and circuits. Handbook of Combinatorics, vol. I, pp. 5\u2013110. Elsevier, Amsterdam (1995)"},{"key":"903_CR4","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0012-365X(96)00071-4","volume":"171","author":"H.J. Broersma","year":"1997","unstructured":"Broersma H.J., Li H., Li J., Tian F., Veldman H.J.: Cycles through subsets with large degree sums. Discrete Math. 171, 43\u201354 (1997)","journal-title":"Discrete Math."},{"key":"903_CR5","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0012-365X(03)00304-2","volume":"276","author":"R. \u010cada","year":"2004","unstructured":"\u010cada R., Flandrin E., Li H., Ryj\u00e1\u010dek Z.: Cycles through given vertices and closures. Discrete Math. 276, 65\u201380 (2004)","journal-title":"Discrete Math."},{"key":"903_CR6","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0012-365X(72)90079-9","volume":"2","author":"V. Chv\u00e1tal","year":"1972","unstructured":"Chv\u00e1tal, V., Erd\u0151s, P.: A note on hamiltonian circuits. Discrete Math. 2, 111\u2013113 (1972)","journal-title":"Discrete Math."},{"key":"903_CR7","doi-asserted-by":"crossref","first-page":"2749","DOI":"10.1016\/j.disc.2008.06.032","volume":"309","author":"J. Cutler","year":"2009","unstructured":"Cutler J.: Trees through specified vertices. Discrete Math. 309, 2749\u20132754 (2009)","journal-title":"Discrete Math."},{"key":"903_CR8","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/(SICI)1097-0118(200003)33:3<125::AID-JGT1>3.0.CO;2-X","volume":"33","author":"M.N. Ellingham","year":"2000","unstructured":"Ellingham M.N., Zha X.: Toughness, trees, and walks. J. Graph Theory 33, 125\u2013137 (2000)","journal-title":"J. Graph Theory"},{"key":"903_CR9","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1002\/(SICI)1097-0118(199604)21:4<357::AID-JGT1>3.0.CO;2-O","volume":"21","author":"O. Favaron","year":"1996","unstructured":"Favaron O., Flandrin E., Li H., Liu Y., Tian F., Wu Z.: Sequences, claws and cyclability of graphs. J. Graph Theory 21, 357\u2013369 (1996)","journal-title":"J. Graph Theory"},{"key":"903_CR10","unstructured":"Fournier, I.: Cycles et Num\u00e9rotations de Graphes. Th\u00e8se d\u2019Etat, L.R.I., Universit\u00e9 de Paris-Sud (1985)"},{"key":"903_CR11","unstructured":"Fujisawa, J., Matsumura, H., Yamashita, T.: Degree bounded trees (submitted)"},{"key":"903_CR12","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1002\/1097-0118(200007)34:3<191::AID-JGT1>3.0.CO;2-V","volume":"34","author":"A. Harkat-Benhamdine","year":"2000","unstructured":"Harkat-Benhamdine A., Li H., Tian F.: Cyclability of 3-connected graphs. J. Graph Theory 34, 191\u2013203 (2000)","journal-title":"J. Graph Theory"},{"key":"903_CR13","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s003730170059","volume":"17","author":"A. Kyaw","year":"2001","unstructured":"Kyaw A.: A sufficient condition for a graph to have a k-tree. Graphs Combin. 17, 113\u2013121 (2001)","journal-title":"Graphs Combin."},{"key":"903_CR14","doi-asserted-by":"crossref","first-page":"3653","DOI":"10.1016\/j.disc.2007.12.099","volume":"309","author":"H. Matsuda","year":"2009","unstructured":"Matsuda H., Matsumura H.: Degree conditions and degree bounded trees. Discrete Math. 309, 3653\u20133658 (2009)","journal-title":"Discrete Math."},{"key":"903_CR15","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/s00373-006-0660-5","volume":"22","author":"H. Matsuda","year":"2006","unstructured":"Matsuda H., Matsumura H.: On a k-tree containing specified leaves in a graph. Graphs Combin. 22, 371\u2013381 (2006)","journal-title":"Graphs Combin."},{"key":"903_CR16","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BF01375473","volume":"11","author":"V. Neumann-Lara","year":"1991","unstructured":"Neumann-Lara V., Rivera-Campo E.: Spanning trees with bounded degrees. Combinatorica 11, 55\u201361 (1991)","journal-title":"Combinatorica"},{"key":"903_CR17","doi-asserted-by":"crossref","first-page":"55","DOI":"10.2307\/2308928","volume":"67","author":"O. Ore","year":"1960","unstructured":"Ore O.: Note on Hamiltonian circuits. Am. Math. Monthly 67, 55 (1960)","journal-title":"Am. Math. Monthly"},{"key":"903_CR18","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0012-365X(94)00036-I","volume":"145","author":"K. Ota","year":"1995","unstructured":"Ota K.: Cycles through prescribed vertices with large degree sum. Discrete Math. 145, 201\u2013210 (1995)","journal-title":"Discrete Math."},{"key":"903_CR19","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1007\/s00373-008-0802-z","volume":"24","author":"K. Ozeki","year":"2008","unstructured":"Ozeki K., Yamashita T.: A degree sum condition concerning the connectivity and the independence number of a graph. Graphs Combin. 24, 469\u2013483 (2008)","journal-title":"Graphs Combin."},{"key":"903_CR20","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1002\/jgt.3190160310","volume":"16","author":"R.H. Shi","year":"1992","unstructured":"Shi R.H.: 2-Neighborhoods and Hamiltonian conditions. J. Graph Theory 16, 267\u2013271 (1992)","journal-title":"J. Graph Theory"},{"key":"903_CR21","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF02995957","volume":"43","author":"S. Win","year":"1975","unstructured":"Win S.: Existenz von Ger\u00fcsten mit vorgeschriebenem Maximalgrad in Graphen. Abh. Math. Seminar Univ. Hamburg 43, 263\u2013267 (1975)","journal-title":"Abh. Math. Seminar Univ. Hamburg"},{"key":"903_CR22","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF01788671","volume":"5","author":"S. Win","year":"1989","unstructured":"Win S.: On a connection between the existence of k-trees and the toughness of a graph. Graphs Combin. 5, 201\u2013205 (1989)","journal-title":"Graphs Combin."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0903-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-010-0903-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0903-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:58:30Z","timestamp":1559041110000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-010-0903-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,23]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["903"],"URL":"https:\/\/doi.org\/10.1007\/s00373-010-0903-3","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2,23]]}}}