{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:39:56Z","timestamp":1740148796304,"version":"3.37.3"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T00:00:00Z","timestamp":1710201600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T00:00:00Z","timestamp":1710201600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12261094","11501256","11701496"],"award-info":[{"award-number":["12261094","11501256","11701496"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1007\/s12190-024-02028-0","type":"journal-article","created":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T00:02:37Z","timestamp":1710288157000},"page":"1723-1746","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Decomposing planar graphs without triangular short cycles into a matching and a 3-colorable graph"],"prefix":"10.1007","volume":"70","author":[{"given":"Ziwen","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fan","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoxia","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,12]]},"reference":[{"issue":"2","key":"2028_CR1","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1002\/jgt.3190100207","volume":"10","author":"LJ Cowen","year":"1986","unstructured":"Cowen, L.J., Cowen, R.H., Woodall, D.R.: Defective colorings of graphs in surfaces: partitions into subgraphs of bounded valency. J. Graph Theory 10(2), 187\u2013195 (1986)","journal-title":"J. Graph Theory"},{"key":"2028_CR2","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1002\/(SICI)1097-0118(199703)24:3<205::AID-JGT2>3.0.CO;2-T","volume":"24","author":"L Cowen","year":"1997","unstructured":"Cowen, L., Goddard, W., Jesurum, C.E.: Defective coloring revisited. J. Graph Theory 24, 205\u2013219 (1997)","journal-title":"J. Graph Theory"},{"key":"2028_CR3","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1016\/j.dam.2008.06.023","volume":"157","author":"W Dong","year":"2009","unstructured":"Dong, W., Xu, B.: A note on list improper coloring of plane graphs. Discerte Appl. Math. 157, 433\u2013436 (2009)","journal-title":"Discerte Appl. Math."},{"key":"2028_CR4","first-page":"109","volume":"8","author":"H Gr\u00f6tzsch","year":"1959","unstructured":"Gr\u00f6tzsch, H.: Ein dreifarbensatz f\u00fcr dreikreisfreienetze auf der kugel. Math.-Nat. Reihe 8, 109\u2013120 (1959)","journal-title":"Math.-Nat. Reihe"},{"key":"2028_CR5","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/j.dam.2019.04.026","volume":"268","author":"Z Huang","year":"2019","unstructured":"Huang, Z., Liu, R., Wang, G.: Decomposing a planar graph without triangular $$4$$-cycles into a matching and a $$3$$-colorable graph. Discerte Appl. Math. 268, 112\u2013118 (2019)","journal-title":"Discerte Appl. Math."},{"key":"2028_CR6","doi-asserted-by":"publisher","first-page":"111846","DOI":"10.1016\/j.disc.2020.111846","volume":"343","author":"Z Huang","year":"2020","unstructured":"Huang, Z.: Every planar graph without triangles adjacent to cycles of length $$3$$ or $$6$$ is $$(1, 1, 1)$$-colorable. Discrete Math. 343, 111846 (2020)","journal-title":"Discrete Math."},{"key":"2028_CR7","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/S0893-9659(00)00147-6","volume":"14","author":"K Lih","year":"2001","unstructured":"Lih, K., Song, Z., Wang, W., Zhang, K.: A note on list improper coloring planar graphs. Appl. Math. Lett. 14, 269\u2013273 (2001)","journal-title":"Appl. Math. Lett."},{"key":"2028_CR8","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1016\/j.disc.2017.11.002","volume":"341","author":"Z Miao","year":"2018","unstructured":"Miao, Z., Wang, Y., Zhang, C., Zhang, H.: Planar graphs without 3-cycles adjacent to cycles of length $$3$$ or $$5$$ are $$(3, 1)$$-colorable. Discrete Math. 341, 588\u2013599 (2018)","journal-title":"Discrete Math."},{"key":"2028_CR9","doi-asserted-by":"publisher","first-page":"2029","DOI":"10.1137\/120885140","volume":"27","author":"Y Wang","year":"2013","unstructured":"Wang, Y., Xu, L.: Improper choosability of planar graphs without 4-cycles. SIAM J. Discrete Math. 27, 2029\u20132037 (2013)","journal-title":"SIAM J. Discrete Math."},{"key":"2028_CR10","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.ejc.2014.08.020","volume":"43","author":"Y Wang","year":"2015","unstructured":"Wang, Y., Xu, J.: Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph. Eur. J. Combin. 43, 98\u2013123 (2015)","journal-title":"Eur. J. Combin."},{"key":"2028_CR11","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1137\/06066093X","volume":"23","author":"B Xu","year":"2009","unstructured":"Xu, B.: On $$(3, 1)^*$$-coloring of planar graphs. SIAM J. Discrete Math. 23, 205\u2013220 (2009)","journal-title":"SIAM J. Discrete Math."}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-024-02028-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-024-02028-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-024-02028-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,17]],"date-time":"2024-04-17T19:21:31Z","timestamp":1713381691000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-024-02028-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,12]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["2028"],"URL":"https:\/\/doi.org\/10.1007\/s12190-024-02028-0","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"type":"print","value":"1598-5865"},{"type":"electronic","value":"1865-2085"}],"subject":[],"published":{"date-parts":[[2024,3,12]]},"assertion":[{"value":"2 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 February 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 February 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 March 2024","order":4,"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"}}]}}