{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T00:17:34Z","timestamp":1760573854348,"version":"build-2065373602"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T00:00:00Z","timestamp":1758844800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T00:00:00Z","timestamp":1758844800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"NSF","award":["DMS-2153507"],"award-info":[{"award-number":["DMS-2153507"]}]},{"name":"NSF RTG","award":["DMS-1937241"],"award-info":[{"award-number":["DMS-1937241"]}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["12371359"],"award-info":[{"award-number":["12371359"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["U20A2068"],"award-info":[{"award-number":["U20A2068"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100005302","name":"University of Illinois at Urbana-Champaign","doi-asserted-by":"publisher","award":["RB24000"],"award-info":[{"award-number":["RB24000"]}],"id":[{"id":"10.13039\/100005302","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":[[2025,10]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>A graph <jats:italic>G<\/jats:italic> is (1,\u00a03)-colorable if its vertices can be partitioned into subsets <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$V_1$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>V<\/mml:mi>\n                    <mml:mn>1<\/mml:mn>\n                  <\/mml:msub>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula> and <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$V_2$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>V<\/mml:mi>\n                    <mml:mn>2<\/mml:mn>\n                  <\/mml:msub>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula> so that every vertex in <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$G[V_1]$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>G<\/mml:mi>\n                    <mml:mo>[<\/mml:mo>\n                    <mml:msub>\n                      <mml:mi>V<\/mml:mi>\n                      <mml:mn>1<\/mml:mn>\n                    <\/mml:msub>\n                    <mml:mo>]<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula> has degree at most 1 and every vertex in <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$G[V_2]$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>G<\/mml:mi>\n                    <mml:mo>[<\/mml:mo>\n                    <mml:msub>\n                      <mml:mi>V<\/mml:mi>\n                      <mml:mn>2<\/mml:mn>\n                    <\/mml:msub>\n                    <mml:mo>]<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula> has degree at most 3. We prove that every graph with maximum average degree at most 28\/9 is (1,\u00a03)-colorable.<\/jats:p>","DOI":"10.1007\/s00373-025-02973-y","type":"journal-article","created":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T19:17:47Z","timestamp":1758914267000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Sparse Critical Graphs for Defective (1,\u00a03)-Coloring"],"prefix":"10.1007","volume":"41","author":[{"given":"Alexandr","family":"Kostochka","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9259-9238","authenticated-orcid":false,"given":"Jingwei","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Xuding","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,26]]},"reference":[{"key":"2973_CR1","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1002\/jgt.3190110408","volume":"11","author":"D Archdeacon","year":"1987","unstructured":"Archdeacon, D.: A note on defective colorings of graphs in surfaces. J. Graph Theory 11, 517\u2013519 (1987)","journal-title":"J. Graph Theory"},{"key":"2973_CR2","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/jgt.20467","volume":"65","author":"OV Borodin","year":"2010","unstructured":"Borodin, O.V., Ivanova, A.O., Montassier, M., Ochem, P., Raspaud, A.: Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most $$k$$. J. Graph Theory 65, 83\u201393 (2010)","journal-title":"J. Graph Theory"},{"key":"2973_CR3","doi-asserted-by":"publisher","first-page":"1947","DOI":"10.1016\/j.dam.2011.06.021","volume":"159","author":"OV Borodin","year":"2011","unstructured":"Borodin, O.V., Ivanova, A.O., Montassier, M., Raspaud, A.: $$(k, j)$$-coloring of sparse graphs. Discrete Appl. Math. 159, 1947\u20131953 (2011)","journal-title":"Discrete Appl. Math."},{"key":"2973_CR4","doi-asserted-by":"publisher","first-page":"1128","DOI":"10.1016\/j.disc.2011.11.031","volume":"312","author":"OV Borodin","year":"2012","unstructured":"Borodin, O.V., Ivanova, A.O., Montassier, M., Raspaud, A.: $$(k, 1)$$-coloring of sparse graphs. Discrete Math. 312, 1128\u20131135 (2012)","journal-title":"Discrete Math."},{"key":"2973_CR5","first-page":"1004","volume":"52","author":"OV Borodin","year":"2011","unstructured":"Borodin, O.V., Kostochka, A.V.: Vertex decompositions of sparse graphs into an independent set and a subgraph of maximum degree at most 1. Sibirsk. Mat. Zh. 52, 1004\u20131010 (2011)","journal-title":"Sibirsk. Mat. Zh."},{"key":"2973_CR6","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.jctb.2013.10.002","volume":"104","author":"OV Borodin","year":"2014","unstructured":"Borodin, O.V., Kostochka, A.V.: Defective 2-colorings of sparse graphs. J. Combin. Theory Ser. B 104, 72\u201380 (2014)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2973_CR7","doi-asserted-by":"publisher","first-page":"2638","DOI":"10.1016\/j.disc.2013.07.014","volume":"313","author":"OV Borodin","year":"2013","unstructured":"Borodin, O.V., Kostochka, A.V., Yancey, M.: On 1-improper 2-coloring of sparse graphs. Discrete Math. 313, 2638\u20132649 (2013)","journal-title":"Discrete Math."},{"key":"2973_CR8","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., Woodall, D.R.: Defective colorings of graphs in surfaces: partitions into subgraphs of bounded valency. J. Graph Theory 10, 187\u2013195 (1986)","journal-title":"J. Graph Theory"},{"key":"2973_CR9","doi-asserted-by":"publisher","first-page":"1385","DOI":"10.1016\/j.ejc.2009.11.013","volume":"31","author":"W Cushing","year":"2010","unstructured":"Cushing, W., Kierstead, H.A.: Planar graphs are 1-relaxed 4-choosable. Eur. J. Combin. 31, 1385\u20131397 (2010)","journal-title":"Eur. J. Combin."},{"key":"2973_CR10","doi-asserted-by":"publisher","first-page":"2385","DOI":"10.1137\/141002177","volume":"29","author":"K Edwards","year":"2015","unstructured":"Edwards, K., Kang, D.Y., Kim, J., Oum, S.-I., Seymour, P.: A relative of hadwiger\u2019s conjecture. SIAM J. Discrete Math. 29, 2385\u20132388 (2015)","journal-title":"SIAM J. Discrete Math."},{"key":"2973_CR11","first-page":"79","volume":"25","author":"N Eaton","year":"1999","unstructured":"Eaton, N., Hull, T.: Defective list colorings of planar graphs. Bull. Inst. Combin. Appl. 25, 79\u201387 (1999)","journal-title":"Bull. Inst. Combin. Appl."},{"key":"2973_CR12","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1002\/jgt.21659","volume":"73","author":"L Esperet","year":"2013","unstructured":"Esperet, L., Montassier, M., Ochem, P., Pinlou, A.: A complexity dichotomy for the coloring of sparse graphs. J. Graph Theory 73, 85\u2013102 (2013)","journal-title":"J. Graph Theory"},{"key":"2973_CR13","unstructured":"Gerencs\u00e9r, L.: On coloring problems.(Hungarian) Mat. Lapok 16, 274\u2013277 (1965)"},{"key":"2973_CR14","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1002\/jgt.20155","volume":"52","author":"F Havet","year":"2006","unstructured":"Havet, F., Sereni, J.-S.: Improper choosability of graphs and maximum average degree. J. Graph Theory 52, 181\u2013199 (2006)","journal-title":"J. Graph Theory"},{"key":"2973_CR15","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1017\/S0963548319000063","volume":"28","author":"K Hendrey","year":"2019","unstructured":"Hendrey, K., Wood, D.: Defective and clustered choosability of sparse graphs. Combin. Probab. Comput. 28, 791\u2013810 (2019)","journal-title":"Combin. Probab. Comput."},{"key":"2973_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2020.103267","volume":"93","author":"Y Jing","year":"2021","unstructured":"Jing, Y., Kostochka, A., Ma, F., Sittitrai, P., Xu, J.: Defective correspondence colorings for sparse multigraphs. Eur. J. Combin. 93, 103267 (2021)","journal-title":"Eur. J. Combin."},{"key":"2973_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2021.112637","volume":"345","author":"Y Jing","year":"2022","unstructured":"Jing, Y., Kostochka, A., Ma, F., Xu, J.: Defective correspondence colorings of sparse simple graphs. Discrete Math. 345, 112637 (2022)","journal-title":"Discrete Math."},{"key":"2973_CR18","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.ejc.2014.05.003","volume":"42","author":"J Kim","year":"2014","unstructured":"Kim, J., Kostochka, A.V., Zhu, X.: Improper coloring of sparse graphs with a given girth, i: $$(0,1)$$-colorings of triangle-free graphs. Eur. J. Comb. 42, 26\u201348 (2014)","journal-title":"Eur. J. Comb."},{"key":"2973_CR19","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1002\/jgt.21886","volume":"81","author":"J Kim","year":"2015","unstructured":"Kim, J., Kostochka, A.V., Zhu, X.: Improper coloring of sparse graphs with a given girth, ii: constructions. J. Graph Theory 81, 403\u2013413 (2015)","journal-title":"J. Graph Theory"},{"key":"2973_CR20","doi-asserted-by":"publisher","first-page":"2528","DOI":"10.1016\/j.disc.2017.06.014","volume":"340","author":"M Kopreski","year":"2017","unstructured":"Kopreski, M., Yu, G.: Maximum average degree and relaxed coloring. Discrete Math. 340, 2528\u20132530 (2017)","journal-title":"Discrete Math."},{"key":"2973_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2020.103217","volume":"91","author":"AV Kostochka","year":"2021","unstructured":"Kostochka, A.V., Xu, J.: On $$2$$-defective correspondence colorings of sparse graphs. Eur. J. Comb. 91, 103217 (2021)","journal-title":"Eur. J. Comb."},{"key":"2973_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2024.113899","volume":"347","author":"AV Kostochka","year":"2024","unstructured":"Kostochka, A.V., Xu, J.: Sparse critical graphs for defective correspondence colorings. Discrete Math. 347, 113899 (2024)","journal-title":"Discrete Math."},{"key":"2973_CR23","first-page":"237","volume":"1","author":"L Lov\u00e1sz","year":"1966","unstructured":"Lov\u00e1sz, L.: On decomposition of graphs. Studia Sci. Math. Hungar. 1, 237\u2013238 (1966)","journal-title":"Studia Sci. Math. Hungar."},{"key":"2973_CR24","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s00493-018-3733-1","volume":"39","author":"P Ossona de Mendez","year":"2019","unstructured":"Ossona de Mendez, P., Oum, S.-I., Wood, D.R.: Defective colouring of graphs excluding a subgraph or minor. Combinatorica 39, 377\u2013410 (2019)","journal-title":"Combinatorica"},{"issue":"1","key":"2973_CR25","first-page":"89","volume":"42","author":"P Sittitrai","year":"2019","unstructured":"Sittitrai, P., Nakprasit, K.: Analogue of correspondence coloring on variable degeneracy and its applications on list vertex-arboricity and correspondence coloring. Discuss. Math. Graph Theory 42(1), 89 (2019)","journal-title":"Discuss. Math. Graph Theory"},{"key":"2973_CR26","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1017\/S0963548399003752","volume":"8","author":"R \u0160krekovski","year":"1999","unstructured":"\u0160krekovski, R.: List improper colourings of planar graphs. Combin. Probab. Comput. 8, 293\u2013299 (1999)","journal-title":"Combin. Probab. Comput."},{"key":"2973_CR27","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0012-365X(99)00145-4","volume":"214","author":"R \u0160krekovski","year":"2000","unstructured":"\u0160krekovski, R.: List improper colorings of planar graphs with prescribed girth. Discrete Math. 214, 221\u2013233 (2000)","journal-title":"Discrete Math."},{"key":"2973_CR28","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1112\/jlms.12127","volume":"98","author":"J Van den Heuvel","year":"2018","unstructured":"Van den Heuvel, J., Wood, D.R.: Improper colourings inspired by hadwiger\u2019s conjecture. J. London Math. Soc. 98, 129\u2013148 (2018)","journal-title":"J. London Math. Soc."},{"key":"2973_CR29","doi-asserted-by":"crossref","unstructured":"Wood, D.R.: Defective and clustered graph colouring. Electron. J. Combin. #DS23, (2018)","DOI":"10.37236\/7406"},{"key":"2973_CR30","doi-asserted-by":"publisher","first-page":"441","DOI":"10.7151\/dmgt.1557","volume":"31","author":"DR Woodall","year":"2011","unstructured":"Woodall, D.R.: Defective choosability of graphs in surfaces. Discuss. Math. Graph Theory 31, 441\u2013459 (2011)","journal-title":"Discuss. Math. Graph Theory"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02973-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02973-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02973-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T05:11:42Z","timestamp":1760505102000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02973-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,26]]},"references-count":30,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["2973"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02973-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2025,9,26]]},"assertion":[{"value":"12 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 September 2025","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 have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}],"article-number":"110"}}