{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:16:10Z","timestamp":1758824170439},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,11,1]],"date-time":"2009-11-01T00:00:00Z","timestamp":1257033600000},"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":[[2009,11]]},"DOI":"10.1007\/s00373-009-0851-y","type":"journal-article","created":{"date-parts":[[2009,12,11]],"date-time":"2009-12-11T09:35:40Z","timestamp":1260524140000},"page":"557-569","source":"Crossref","is-referenced-by-count":1,"title":["On the Structure of Contractible Edges in k-connected Partial k-trees"],"prefix":"10.1007","volume":"25","author":[{"given":"N. S.","family":"Narayanaswamy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Sadagopan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L. Sunil","family":"Chandran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,12,12]]},"reference":[{"key":"851_CR1","doi-asserted-by":"crossref","unstructured":"Ando, K., Kaneko, K., Kawarabayashi, A.: Vertices of degree 5 in a 5-contraction critical graph. Graphs Combin 21(1), 27\u201337 (2005)","DOI":"10.1007\/s00373-004-0591-y"},{"key":"851_CR2","unstructured":"Arnborg, S., Proskurowski, A.: Linear time algorithms for NP-hard problems restricted to partial k-trees. Discrete Appl. Math. 23, 11\u201324 (1989)"},{"key":"851_CR3","unstructured":"Dean, N., Hemminger, R.L., Toft, B.: On contractible edges in 3-connected graphs. Congr. Numer. 58, 291\u2013293 (1987)"},{"key":"851_CR4","doi-asserted-by":"crossref","unstructured":"Dean, N., Hemminger, R.L., Ota, K.: k Longest cycles in 3-connected graphs contain three contractible edges. J. Graph Theory 13(1), 17\u201321 (1989)","DOI":"10.1002\/jgt.3190130105"},{"key":"851_CR5","unstructured":"Dean, N.: Distribution of contractible edges in k-connected graphs. J. Combin. Theory, Ser. B, 48, 1\u20135 (2003)"},{"key":"851_CR6","doi-asserted-by":"crossref","unstructured":"Ellingham, M.N., Hemminger, R.L., Johnson, K.E.: Contractible edges in longest cycles in non-hamiltonian graphs. Discrete Math. 133 89\u201398 (1994)","DOI":"10.1016\/0012-365X(94)90018-3"},{"key":"851_CR7","doi-asserted-by":"crossref","unstructured":"Fujita, K.: Maximum number of contractible edges on Hamiltonian cycles of a 3-connected graph. Graphs Combin. 18(3), 447\u2013478 (2005)","DOI":"10.1007\/s003730200033"},{"key":"851_CR8","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic, London (1980)","DOI":"10.1016\/B978-0-12-289260-8.50010-8"},{"key":"851_CR9","doi-asserted-by":"crossref","unstructured":"Jani, M., Rieger, R.G., Zeleke, M.: Enumeration of k-trees and applications. Ann. Combin. 6, 375\u2013382 (2002)","DOI":"10.1007\/s000260200010"},{"key":"851_CR10","doi-asserted-by":"crossref","unstructured":"Kriesell, M.: A survey on contractible edges in graphs of a prescribed vertex connectivity. Graphs Combin. 18, 1\u201330 (2002)","DOI":"10.1007\/s003730200000"},{"key":"851_CR11","unstructured":"Mandaltsis, D., Kontoleon, J.M.: Enumeration of k-trees and their applications to the reliability evaluation of communication networks. Ann. Combin. 29, 733\u2013735 (1989)"},{"key":"851_CR12","doi-asserted-by":"crossref","unstructured":"Martinov, N.: Uncontractible 4-connected graphs. J. Graph Theory 6, 343\u2013344 (1982)","DOI":"10.1002\/jgt.3190060310"},{"key":"851_CR13","doi-asserted-by":"crossref","unstructured":"Martinov, N.: A recursive characterisation of 4-connected graphs. Discrete Math. 84, 105\u2013108 (1990)","DOI":"10.1016\/0012-365X(90)90277-O"},{"key":"851_CR14","unstructured":"Proskurowski, A.: Recursive graphs, recursive labelings and shortest paths. SIAM J. Comput. 10(2), 391\u2013397 (1981)"},{"key":"851_CR15","doi-asserted-by":"crossref","unstructured":"Saito, A.: Covering contractible edges in 3-connected graphs. J. Graph Theory 14(6), 635\u2013643 (1990)","DOI":"10.1002\/jgt.3190140603"},{"key":"851_CR16","doi-asserted-by":"crossref","unstructured":"Saito, A., Ando, K., Enomoto, H.: Contractible edges in 3-connected graphs. J. Combin. Theory-B 42(1) (1987)","DOI":"10.1016\/0095-8956(87)90065-7"},{"key":"851_CR17","doi-asserted-by":"crossref","unstructured":"Rose, D.J.: Triangulated graphs and elimination process. J. Math. Anal. Appl. 32, 597\u2013609 (1970)","DOI":"10.1016\/0022-247X(70)90282-9"},{"key":"851_CR18","doi-asserted-by":"crossref","unstructured":"Rose, D.J.: On simple characterisations of k-trees. Discrete Math. 7, 317\u2013322 (1974)","DOI":"10.1016\/0012-365X(74)90042-9"},{"key":"851_CR19","doi-asserted-by":"crossref","unstructured":"Thomassen, C.: Non-separating cycles in k-connected graphs. J. Graph Theory 5, 351\u2013354 (1981)","DOI":"10.1002\/jgt.3190050403"},{"key":"851_CR20","unstructured":"Tutte, W.T.: A theory of 3-connected graphs. Indag. Math 23, 441\u2013455 (1961)"},{"key":"851_CR21","unstructured":"West, D.B.: Introduction to graph theory. Prentice Hall of India (2003)"},{"key":"851_CR22","unstructured":"Yang, D., Iwama, K., Naoki, K.: A new probabilistic analysis of Karger\u2019s randomized algorithm for min-cut problems. Inf. Process. Lett. 64(5), 255\u2013261 (1997)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-009-0851-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-009-0851-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-009-0851-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:29Z","timestamp":1559055509000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-009-0851-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,11]]}},"alternative-id":["851"],"URL":"https:\/\/doi.org\/10.1007\/s00373-009-0851-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,11]]}}}