{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:58:53Z","timestamp":1725861533250},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319426334"},{"type":"electronic","value":"9783319426341"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-42634-1_32","type":"book-chapter","created":{"date-parts":[[2016,7,19]],"date-time":"2016-07-19T15:50:21Z","timestamp":1468943421000},"page":"393-404","source":"Crossref","is-referenced-by-count":2,"title":["Decomposing Cubic Graphs into Connected Subgraphs of Size Three"],"prefix":"10.1007","author":[{"given":"Laurent","family":"Bulteau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillaume","family":"Fertin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anthony","family":"Labarre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Romeo","family":"Rizzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Irena","family":"Rusu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,20]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"Bouchet, A., Fouquet, J.-L. Trois types de d\u00e9compositions d\u2019un graphe en cha\u00e9nes. In: Berge, C., Bresson, D., Camion, P., Maurras, J.F., Sterboul, F. (eds.) Combinatorial Mathematics: Proceedings of the International Colloquium on Graph Theory and Combinatorics. North-Holland Mathematics Studies, vol. 75, pp. 131\u2013141, North-Holland (1983)","DOI":"10.1016\/S0304-0208(08)73380-2"},{"key":"32_CR2","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph classes: a survey. SIAM Monographs on Discrete Mathematics and Applications, Society for Industrial Mathematics (1987)"},{"key":"32_CR3","doi-asserted-by":"crossref","first-page":"1166","DOI":"10.1137\/S0097539792229507","volume":"26","author":"D Dor","year":"1997","unstructured":"Dor, D., Tarsi, M.: Graph decomposition is NP-complete: a complete proof of Holyer\u2019s conjecture. SIAM J. Comput. 26, 1166\u20131187 (1997)","journal-title":"SIAM J. Comput."},{"key":"32_CR4","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0166-218X(85)90008-3","volume":"10","author":"ME Dyer","year":"1985","unstructured":"Dyer, M.E., Frieze, A.M.: On the complexity of partitioning graphs into connected subgraphs. Discrete Appl. Math. 10, 139\u2013153 (1985)","journal-title":"Discrete Appl. Math."},{"key":"32_CR5","doi-asserted-by":"crossref","first-page":"1870","DOI":"10.1016\/j.disc.2007.12.093","volume":"309","author":"\u00c9 Fusy","year":"2009","unstructured":"Fusy, \u00c9.: Transversal structures on triangulations: a combinatorial study and straight-line drawings. Discrete Math. 309, 1870\u20131894 (2009)","journal-title":"Discrete Math."},{"key":"32_CR6","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1137\/0210054","volume":"10","author":"I Holyer","year":"1981","unstructured":"Holyer, I.: The NP-completeness of some edge-partition problems. SIAM J. Comput. 10, 713\u2013717 (1981)","journal-title":"SIAM J. Comput."},{"key":"32_CR7","first-page":"191","volume":"2","author":"TP Kirkman","year":"1847","unstructured":"Kirkman, T.P.: On a problem in combinatorics. Camb. Dublin Math. J. 2, 191\u2013204 (1847)","journal-title":"Camb. Dublin Math. J."},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"Kotzig, A.: Z teorie kone\u010dn\u00fdch pravideln\u00fdch grafov tretieho a \u0161tvrt\u00e9ho stup\u0148a, \u010casopis pro p\u011bstov\u00e1n\u00ed matematiky, pp. 76\u201392 (1957)","DOI":"10.21136\/CPM.1957.117236"},{"key":"32_CR9","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1007\/s00454-001-0047-6","volume":"26","author":"C Moore","year":"2001","unstructured":"Moore, C., Robson, J.M.: Hard tiling problems with simple tiles. Discrete Comput. Geom. 26, 573\u2013590 (2001)","journal-title":"Discrete Comput. Geom."},{"key":"32_CR10","doi-asserted-by":"crossref","first-page":"1490","DOI":"10.1137\/090775440","volume":"25","author":"X Mu\u00f1oz","year":"2011","unstructured":"Mu\u00f1oz, X., Li, Z., Sau, I.: Edge-partitioning regular graphs for ring traffic grooming with a priori placement of the ADMs. SIAM J. Discrete Math. 25, 1490\u20131505 (2011)","journal-title":"SIAM J. Discrete Math."},{"key":"32_CR11","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.cosrev.2007.07.002","volume":"1","author":"R Yuster","year":"2007","unstructured":"Yuster, R.: Combinatorial and computational aspects of graph packing and graph decomposition. Comput. Sci. Rev. 1, 12\u201326 (2007)","journal-title":"Comput. Sci. Rev."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42634-1_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,24]],"date-time":"2020-09-24T03:41:32Z","timestamp":1600918892000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42634-1_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319426334","9783319426341"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42634-1_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}