{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:33:55Z","timestamp":1759638835342},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642033506"},{"type":"electronic","value":"9783642033513"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03351-3_15","type":"book-chapter","created":{"date-parts":[[2009,8,3]],"date-time":"2009-08-03T12:53:58Z","timestamp":1249304038000},"page":"143-154","source":"Crossref","is-referenced-by-count":1,"title":["Partitioning Graphs into Connected Parts"],"prefix":"10.1007","author":[{"given":"Pim","family":"van \u2019t Hof","sequence":"first","affiliation":[]},{"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[]},{"given":"Gerhard J.","family":"Woeginger","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"15_CR1","first-page":"51","volume":"22","author":"G. Bacs\u00f3","year":"1997","unstructured":"Bacs\u00f3, G., Tuza, Z.: Dominating Subgraphs of Small Diameter. Journal of Combinatorics, Information and System Sciences\u00a022(1), 51\u201362 (1997)","journal-title":"Journal of Combinatorics, Information and System Sciences"},{"key":"15_CR2","unstructured":"Blum, D.: Circularity of Graphs. PhD thesis, Virginia Polytechnic Institute and State University (1982)"},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1002\/jgt.3190110111","volume":"11","author":"A.E. Brouwer","year":"1987","unstructured":"Brouwer, A.E., Veldman, H.J.: Contractibility and NP-completeness. Journal of Graph Theory\u00a011, 71\u201379 (1987)","journal-title":"Journal of Graph Theory"},{"key":"15_CR4","volume-title":"Graph Theory","author":"R. Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory, 3rd edn. Springer, Heidelberg (2005)","edition":"3"},{"issue":"2","key":"15_CR5","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s00453-007-9145-z","volume":"52","author":"F.V. Fomin","year":"2008","unstructured":"Fomin, F.V., Grandoni, F., Kratsch, D.: Solving Connected Dominating Set Faster than 2\n                    n\n                  . Algorithmica\u00a052(2), 153\u2013166 (2008)","journal-title":"Algorithmica"},{"key":"15_CR6","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. W.H. Freeman and Co., New York (1979)"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0166-218X(01)00321-3","volume":"125","author":"M.U. Gerber","year":"2003","unstructured":"Gerber, M.U., Lozin, V.V.: On the Stable Set Problem in Special P\n                  5-Free Graphs. Discrete Applied Mathematics\u00a0125, 215\u2013224 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Ho\u00e0ng, C.T., Kami\u0144ski, M., Lozin, V.V., Sawada, J., Shu, X.: Deciding k-Colorability of P\n                  5-Free Graphs in Polynomial Time. Algorithmica (to appear)","DOI":"10.1007\/s00453-008-9197-8"},{"issue":"7","key":"15_CR9","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1016\/j.dam.2008.08.025","volume":"158","author":"Pim van \u2019t Hof","year":"2010","unstructured":"van \u2019t Hof, P., Paulusma, D.: A New Characterization of P\n                  6-Free Graphs. Discrete Applied Mathematics (to appear), doi:10.1016\/j.dam.2008.08.025","journal-title":"Discrete Applied Mathematics"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0166-218X(99)00046-3","volume":"92","author":"R. Mosca","year":"1999","unstructured":"Mosca, R.: Stable Sets in Certain P\n                  6-Free Graphs. Discrete Applied Mathematics\u00a092, 177\u2013191 (1999)","journal-title":"Discrete Applied Mathematics"},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/S0166-218X(03)00446-3","volume":"136","author":"B. Randerath","year":"2004","unstructured":"Randerath, B., Schiermeyer, I.: 3-Colorability \u2208 \n                    \n                      \n                    \n                    $\\P$\n                   for P\n                  6-Free Graphs. Discrete Applied Mathematics\u00a0136, 299\u2013313 (2004)","journal-title":"Discrete Applied Mathematics"},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1006\/jctb.1995.1006","volume":"63","author":"N. Robertson","year":"1995","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. XIII. The Disjoint Paths Problem. Journal of Combinatorial Theory, Series B\u00a063, 65\u2013110 (1995)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"1","key":"15_CR13","first-page":"107","volume":"15","author":"G.J. Woeginger","year":"2001","unstructured":"Woeginger, G.J., Sgall, J.: The Complexity of Coloring Graphs without Long Induced Paths. Acta Cybernetica\u00a015(1), 107\u2013117 (2001)","journal-title":"Acta Cybernetica"}],"container-title":["Lecture Notes in Computer Science","Computer Science - Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03351-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,8]],"date-time":"2018-10-08T22:12:10Z","timestamp":1539036730000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03351-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642033506","9783642033513"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03351-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}