{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:28Z","timestamp":1740107128872,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,9,21]],"date-time":"2024-09-21T00:00:00Z","timestamp":1726876800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,9,21]],"date-time":"2024-09-21T00:00:00Z","timestamp":1726876800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100020884","name":"Agencia Nacional de Investigaci\u00f3n y Desarrollo","doi-asserted-by":"publisher","award":["Fondecyt\/Regular 1220071","PCI\/REDES 190071"],"award-info":[{"award-number":["Fondecyt\/Regular 1220071","PCI\/REDES 190071"]}],"id":[{"id":"10.13039\/501100020884","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N \u00ecvel Superior","doi-asserted-by":"publisher","award":["001"],"award-info":[{"award-number":["001"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["423395\/2018-1","423833\/2018-9","06464\/2016-0"],"award-info":[{"award-number":["423395\/2018-1","423833\/2018-9","06464\/2016-0"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2017\/23623-4","2015\/11937-9"],"award-info":[{"award-number":["2017\/23623-4","2015\/11937-9"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004586","name":"Funda\u00e7\u00e3o Carlos Chagas Filho de Amparo \u00e0 Pesquisa do Estado do Rio de Janeiro","doi-asserted-by":"publisher","award":["211.305\/2019"],"award-info":[{"award-number":["211.305\/2019"]}],"id":[{"id":"10.13039\/501100004586","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1007\/s00373-024-02833-1","type":"journal-article","created":{"date-parts":[[2024,9,21]],"date-time":"2024-09-21T14:01:33Z","timestamp":1726927293000},"update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Structure of a Smallest Counterexample and a New Class Verifying the 2-Decomposition Conjecture"],"prefix":"10.1007","volume":"40","author":[{"given":"F.","family":"Botler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0002-6671-1599","authenticated-orcid":false,"given":"A.","family":"Jim\u00e9nez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Sambinelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y.","family":"Wakabayashi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,9,21]]},"reference":[{"key":"2833_CR1","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.dam.2020.01.016","volume":"296","author":"E Aboomahigir","year":"2020","unstructured":"Aboomahigir, E., Ahanjideh, M., Akbari, S.: Decomposing claw-free subcubic graphs and 4-chordal subcubic graphs. Discr. Appl. Math. 296, 52\u201355 (2020)","journal-title":"Discr. Appl. Math."},{"issue":"8","key":"2833_CR2","doi-asserted-by":"publisher","first-page":"1322","DOI":"10.1016\/j.disc.2015.02.021","volume":"338","author":"S Akbari","year":"2015","unstructured":"Akbari, S., Jensen, T.R., Siggers, M.: Decompositions of graphs into trees, forests, and regular subgraphs. Discrete Math. 338(8), 1322\u20131327 (2015)","journal-title":"Discrete Math."},{"issue":"2","key":"2833_CR3","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1002\/jgt.3190140212","volume":"14","author":"MO Albertson","year":"1990","unstructured":"Albertson, M.O., Berman, D.M., Hutchinson, J.P., Thomassen, C.: Graphs with homeomorphically irreducible spanning trees. J. Graph Theory 14(2), 247\u2013258 (1990)","journal-title":"J. Graph Theory"},{"issue":"4","key":"2833_CR4","first-page":"1","volume":"29","author":"O Bachtler","year":"2022","unstructured":"Bachtler, O., Krumke, S.O.: Towards obtaining a 3-decomposition from a perfect matching. Electron. J. Comb. 29(4), 1\u201320 (2022)","journal-title":"Electron. J. Comb."},{"key":"2833_CR5","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Graduate Texts in Mathematics, Springer, New York, London (2008)"},{"key":"2833_CR6","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/j.procs.2021.11.044","volume":"195","author":"F Botler","year":"2021","unstructured":"Botler, F., Jimenez, A., Sambinelli, M., Wakabayashi, Y.: The $$2$$-decomposition conjecture for a new class of graphs. Proc. Comput. Sci. 195, 359\u2013367 (2021)","journal-title":"Proc. Comput. Sci."},{"issue":"1\u20132","key":"2833_CR7","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1017\/S0963548311000526","volume":"21","author":"G Chen","year":"2012","unstructured":"Chen, G., Ren, H., Shan, S.: Homeomorphically irreducible spanning trees in locally connected graphs. Combin. Prob. Comput. 21(1\u20132), 107\u2013111 (2012)","journal-title":"Combin. Prob. Comput."},{"issue":"4","key":"2833_CR8","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/j.jctb.2013.04.001","volume":"103","author":"G Chen","year":"2013","unstructured":"Chen, G., Shan, S.: Homeomorphically irreducible spanning trees. J. Combin. Theory Ser. B 103(4), 409\u2013414 (2013)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1\u20133","key":"2833_CR9","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0012-365X(92)90130-8","volume":"105","author":"RJ Douglas","year":"1992","unstructured":"Douglas, R.J.: NP-completeness and degree restricted spanning trees. Discrete Math. 105(1\u20133), 41\u201347 (1992)","journal-title":"Discrete Math."},{"doi-asserted-by":"crossref","unstructured":"Hill, A.: Graphs with Homeomorphically Irreducible Spanning Trees, Combinatorics (Proc. British Combinatorial Conf., Univ. Coll. Wales, Aberystwyth, 1973). London Math. Soc. Lecture Note Ser., vol. 13, pp.\u00a061\u201368 (1974)","key":"2833_CR10","DOI":"10.1017\/CBO9780511662072.011"},{"unstructured":"Hoffmann-Ostenhof, A.: Nowhere-Zero Flows and Structures In Cubic Graphs. PhD thesis, University of Vienna, Vienna, Austria (2011)","key":"2833_CR11"},{"unstructured":"Hoffmann-Ostenhof, A.: A Survey on the $$3$$-Decomposition Conjecture (2016) (manuscript)","key":"2833_CR12"},{"issue":"4","key":"2833_CR13","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1002\/jgt.22234","volume":"88","author":"A Hoffmann-Ostenhof","year":"2018","unstructured":"Hoffmann-Ostenhof, A., Kaiser, T., Ozeki, K.: Decomposing planar cubic graphs. J. Graph Theory 88(4), 631\u2013640 (2018)","journal-title":"J. Graph Theory"},{"issue":"2","key":"2833_CR14","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1002\/jgt.22242","volume":"89","author":"A Hoffmann-Ostenhof","year":"2018","unstructured":"Hoffmann-Ostenhof, A., Noguchi, K., Ozeki, K.: On homeomorphically irreducible spanning trees in cubic graphs. J. Graph Theory 89(2), 93\u2013100 (2018)","journal-title":"J. Graph Theory"},{"key":"2833_CR15","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.dam.2020.03.040","volume":"284","author":"Y Hong","year":"2020","unstructured":"Hong, Y., Liu, Q., Yu, N.: Edge decomposition of connected claw-free cubic graphs. Discrete Appl. Math. 284, 246\u2013250 (2020)","journal-title":"Discrete Appl. Math."},{"key":"2833_CR16","first-page":"411","volume":"117","author":"R Li","year":"2014","unstructured":"Li, R., Cui, Q.: Spanning trees in subcubic graphs. Ars Combin. 117, 411\u2013415 (2014)","journal-title":"Ars Combin."},{"issue":"1","key":"2833_CR17","doi-asserted-by":"publisher","first-page":"35","DOI":"10.7151\/dmgt.2132","volume":"40","author":"W Liu","year":"2020","unstructured":"Liu, W., Li, P.: Decompositions of cubic traceable graphs. Discuss. Math. Graph Theory 40(1), 35\u201349 (2020)","journal-title":"Discuss. Math. Graph Theory"},{"issue":"1","key":"2833_CR18","doi-asserted-by":"publisher","first-page":"6","DOI":"10.37236\/7970","volume":"26","author":"KS Lyngsie","year":"2019","unstructured":"Lyngsie, K.S., Merker, M.: Decomposing graphs into a spanning tree, an even graph, and a star forest. Electron. J. Combin. 26(1), 6 (2019)","journal-title":"Electron. J. Combin."},{"issue":"A","key":"2833_CR19","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.ejc.2015.08.005","volume":"52","author":"K Ozeki","year":"2016","unstructured":"Ozeki, K., Ye, D.: Decomposing plane cubic graphs. Eur. J. Combin. 52(A), 40\u201346 (2016)","journal-title":"Eur. J. Combin."},{"issue":"6","key":"2833_CR20","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.disc.2020.111839","volume":"343","author":"M Xie","year":"2020","unstructured":"Xie, M., Zhou, C., Zhou, S.: Decomposition of cubic graphs with a 2-factor consisting of three cycles. Discrete Math. 343(6), 10 (2020)","journal-title":"Discrete Math."},{"issue":"10","key":"2833_CR21","doi-asserted-by":"publisher","first-page":"2893","DOI":"10.1016\/j.disc.2019.01.032","volume":"342","author":"S Zhai","year":"2019","unstructured":"Zhai, S., Wei, E., He, J., Ye, D.: Homeomorphically irreducible spanning trees in hexangulations of surfaces. Discrete Math. 342(10), 2893\u20132899 (2019)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02833-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/article\/10.1007\/s00373-024-02833-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02833-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,24]],"date-time":"2024-10-24T15:04:30Z","timestamp":1729782270000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/10.1007\/s00373-024-02833-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,21]]},"references-count":21,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["2833"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/s00373-024-02833-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2024,9,21]]},"assertion":[{"value":"23 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 August 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 September 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"102"}}