{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:47:47Z","timestamp":1770994067933,"version":"3.50.1"},"reference-count":92,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,8,14]],"date-time":"2018-08-14T00:00:00Z","timestamp":1534204800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1007\/s00493-018-3733-1","type":"journal-article","created":{"date-parts":[[2018,8,14]],"date-time":"2018-08-14T03:16:36Z","timestamp":1534216596000},"page":"377-410","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Defective Colouring of Graphs Excluding A Subgraph or Minor"],"prefix":"10.1007","volume":"39","author":[{"given":"Patrice","family":"Ossona De Mendez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sang-Il","family":"Oum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David R.","family":"Wood","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,14]]},"reference":[{"key":"3733_CR1","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1002\/jgt.22203","volume":"88","author":"B. Albar","year":"2018","unstructured":"B. Albar and D. Gonc\u00e0lves: On triangles in Kr-minor free graphs, J. Graph Theory 88 (2018), 154\u2013173.","journal-title":"J. Graph Theory"},{"key":"3733_CR2","first-page":"5","volume":"4","author":"M. O. Albertson","year":"2011","unstructured":"M. O. Albertson, D. L. Boutin and E. Gethner: More results on r-in ated graphs: arboricity, thickness, chromatic number and fractional chromatic number, Ars Math. Contemp. 4 (2011), 5\u201324.","journal-title":"thickness, chromatic number and fractional chromatic number, Ars Math. Contemp."},{"key":"3733_CR3","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1002\/jgt.3190110408","volume":"11","author":"D. Archdeacon","year":"1987","unstructured":"D. Archdeacon: A note on defective colorings of graphs in surfaces, J. Graph Theory 11 (1987), 517\u2013519.","journal-title":"J. Graph Theory"},{"key":"3733_CR4","doi-asserted-by":"crossref","unstructured":"J. Bar\u00e1t, G. Joret and D. R. Wood: Disproof of the list Hadwiger conjecture, Electron. J. Combin. 18, 2011. http:\/\/www.combinatorics.org\/v18i1p232 .","DOI":"10.37236\/719"},{"key":"3733_CR5","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/0095-8956(79)90021-2","volume":"27","author":"F. Bernhart","year":"1979","unstructured":"F. Bernhart and P. C. Kainen: The book thickness of a graph, J. Combin. Theory Ser. B 27 (1979), 320\u2013331.","journal-title":"J. Combin. Theory Ser. B"},{"key":"3733_CR6","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1142\/S021821650700552X","volume":"16","author":"P. Blain","year":"2007","unstructured":"P. Blain, G. Bowlin, T. Fleming, J. Foisy, J. Hendricks and J. Lacombe: Some results on intrinsically knotted graphs, J. Knot Theory Ramifications 16 (2007), 749\u2013760.","journal-title":"J. Knot Theory Ramifications"},{"key":"3733_CR7","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1006\/eujc.1997.0188","volume":"19","author":"B. Bollob\u00e1s","year":"1998","unstructured":"B. Bollob\u00e1s and A. Thomason: Proof of a conjecture of Mader, Erd\u0151s and Hajnal on topological complete subgraphs, European J. Combin. 19 (1998), 883\u2013887.","journal-title":"European J. Combin."},{"key":"3733_CR8","first-page":"180","volume":"394","author":"O. V. Borodin","year":"1989","unstructured":"O. V. Borodin: On the total coloring of planar graphs, J. Reine Angew. Math. 394 (1989), 180\u2013185.","journal-title":"J. Reine Angew. Math."},{"key":"3733_CR9","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.jctb.2013.10.002","volume":"104","author":"O. V. Borodin","year":"2014","unstructured":"O. V. Borodin and A. V. Kostochka: Defective 2-colorings of sparse graphs, J. Combin. Theory Ser. B 104 (2014), 72\u201380.","journal-title":"J. Combin. Theory Ser. B"},{"key":"3733_CR10","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1002\/mana.19941700103","volume":"170","author":"O. V. Borodin","year":"1994","unstructured":"O. V. Borodin and D. P. Sanders: On light edges and triangles in planar graphs of minimum degree five, Math. Nachr. 170 (1994), 19\u201324.","journal-title":"Math. Nachr."},{"key":"3733_CR11","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1002\/jgt.20346","volume":"60","author":"O. V. Borodin","year":"2009","unstructured":"O. V. Borodin, A. V. Kostochka, N. N. Sheikh and G. Yu: M-degrees of quadrangle-free planar graphs, J. Graph Theory 60 (2009), 80\u201385.","journal-title":"J. Graph Theory"},{"key":"3733_CR12","doi-asserted-by":"publisher","first-page":"1947","DOI":"10.1016\/j.dam.2011.06.021","volume":"159","author":"O. V. Borodin","year":"2011","unstructured":"O. V. Borodin, A. O. Ivanova, M. Montassier and A. Raspaud: (k, j)-coloring of sparse graphs, Discrete Appl. Math. 159 (2011), 1947\u20131953.","journal-title":"j)-coloring of sparse graphs, Discrete Appl. Math."},{"key":"3733_CR13","doi-asserted-by":"publisher","first-page":"1128","DOI":"10.1016\/j.disc.2011.11.031","volume":"312","author":"O. V. Borodin","year":"2012","unstructured":"O. V. Borodin, A. O. Ivanova, M. Montassier and A. Raspaud: (k, 1)-coloring of sparse graphs, Discrete Math. 312 (2012), 1128\u20131135.","journal-title":"1)-coloring of sparse graphs, Discrete Math."},{"key":"3733_CR14","doi-asserted-by":"publisher","first-page":"2638","DOI":"10.1016\/j.disc.2013.07.014","volume":"313","author":"O. V. Borodin","year":"2013","unstructured":"O. V. Borodin, A. Kostochka and M. Yancey: On 1-improper 2-coloring of sparse graphs, Discrete Math. 313 (2013), 2638\u20132649.","journal-title":"Discrete Math."},{"key":"3733_CR15","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.disc.2003.12.003","volume":"282","author":"P. Bose","year":"2004","unstructured":"P. Bose, M. Smid and D. R. Wood: Light edges in degree-constrained graphs, Discrete Math. 282 (2004), 35\u201341.","journal-title":"Discrete Math."},{"key":"3733_CR16","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.dam.2013.09.009","volume":"162","author":"M. Chen","year":"2014","unstructured":"M. Chen and A. Raspaud: On (3, 1)*-choosability of planar graphs without adjacent short cycles, Discrete Appl. Math. 162 (2014), 159\u2013166.","journal-title":"Discrete Appl. Math."},{"key":"3733_CR17","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1007\/s10878-015-9913-7","volume":"32","author":"M. Chen","year":"2016","unstructured":"M. Chen, A. Raspaud and W. Wang: A (3,1)*-choosable theorem on planar graphs, J. Comb. Optim. 32 (2016), 927\u2013940.","journal-title":"J. Comb. Optim."},{"key":"3733_CR18","volume-title":"Improper coloring of graphs on surfaces","author":"I. Choi","year":"2016","unstructured":"I. Choi and L. Esperet: Improper coloring of graphs on surfaces, arXiv: 1603.02841, 2016."},{"key":"3733_CR19","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1016\/j.disc.2014.11.012","volume":"338","author":"I. Choi","year":"2015","unstructured":"I. Choi and A. Raspaud: Planar graphs with girth at least 5 are (3, 5)-colorable, Discrete Math. 338 (2015), 661\u2013667.","journal-title":"5)-colorable, Discrete Math."},{"key":"3733_CR20","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0095-8956(90)90093-F","volume":"50","author":"Y. Colin Verdi\u00e8re de","year":"1990","unstructured":"Y. Colin de Verdi\u00e8re: Sur un nouvel invariant des graphes et un crit\u00e8re de planarit \u00e9, J. Combin. Theory Ser. B 50 (1990), 11\u201321.","journal-title":"J. Combin. Theory Ser. B"},{"key":"3733_CR21","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1090\/conm\/147\/01168","volume-title":"Graph structure theory","author":"Y. Colin Verdi\u00e8re de","year":"1993","unstructured":"Y. Colin de Verdi\u00e8re: On a new graph invariant and a criterion for planarity, in: Graph structure theory, volume 147 of Contemp. Math., 137\u2013147, Amer. Math. Soc., 1993."},{"key":"3733_CR22","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1002\/jgt.3190070410","volume":"7","author":"J. H. Conway","year":"1983","unstructured":"J. H. Conway and C. M. Gordon: Knots and links in spatial graphs, J. Graph Theory 7 (1983), 445\u2013453.","journal-title":"J. Graph Theory"},{"key":"3733_CR23","first-page":"219","volume":"43","author":"R. Corr\u00eaa","year":"2009","unstructured":"R. Corr\u00eaa, F. Havet and J.-S. Sereni: About a Brooks-type theorem for improper colouring, Australas. J. Combin. 43 (2009), 219\u2013230.","journal-title":"Australas. J. Combin."},{"key":"3733_CR24","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":"L. Cowen, W. Goddard and C. E. Jesurum: Defective coloring revisited, J. Graph Theory 24 (1997), 205\u2013219.","journal-title":"J. Graph Theory"},{"key":"3733_CR25","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1002\/jgt.3190100207","volume":"10","author":"L. J. Cowen","year":"1986","unstructured":"L. J. Cowen, R. H. Cowen and D. R. Woodall: Defective colorings of graphs in surfaces: partitions into subgraphs of bounded valency, J. Graph Theory 10 (1986), 187\u2013195.","journal-title":"J. Graph Theory"},{"key":"3733_CR26","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.dam.2013.11.001","volume":"167","author":"E. Klerk de","year":"2014","unstructured":"E. de Klerk, D. V. Pasechnik and G. Salazar: Book drawings of complete bipartite graphs, Discrete Appl. Math. 167 (2014), 80\u201393.","journal-title":"Discrete Appl. Math."},{"key":"3733_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14279-6","volume-title":"Graph theory","author":"R. Diestel","year":"2010","unstructured":"R. Diestel: Graph theory, volume 173 of Graduate Texts in Mathematics, Springer, 4th edition, 2010."},{"key":"3733_CR28","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1002\/jgt.21731","volume":"75","author":"P. Dorbec","year":"2014","unstructured":"P. Dorbec, T. Kaiser, M. Montassier and A. Raspaud: Limits of near-coloring of sparse graphs, J. Graph Theory 75 (2014), 191\u2013202.","journal-title":"J. Graph Theory"},{"key":"3733_CR29","first-page":"339","volume":"6","author":"V. Dujmovi\u0107","year":"2004","unstructured":"V. Dujmovi\u0107 and D. R. Wood: On linear layouts of graphs, Discrete Math. Theor. Comput. Sci. 6 (2004), 339\u2013358.","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"3733_CR30","first-page":"79","volume":"25","author":"N. Eaton","year":"1999","unstructured":"N. Eaton and T. Hull: Defective list colorings of planar graphs, Bull. Inst. Combin. Appl 25 (1999), 79\u201387.","journal-title":"Bull. Inst. Combin. Appl"},{"key":"3733_CR31","doi-asserted-by":"publisher","first-page":"2385","DOI":"10.1137\/141002177","volume":"29","author":"K. Edwards","year":"2015","unstructured":"K. Edwards, D. Y. Kang, J. Kim, S. Oum and P. Seymour: A relative of Hadwiger's conjecture, SIAM J. Discrete Math. 29 (2015), 2385\u20132388.","journal-title":"SIAM J. Discrete Math."},{"key":"3733_CR32","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0166-218X(99)00044-X","volume":"92","author":"H. Enomoto","year":"1999","unstructured":"H. Enomoto, M. S. Miyauchi and K. Ota: Lower bounds for the number of edgecrossings over the spine in a topological book embedding of a graph, Discrete Appl. Math. 92 (1999), 149\u2013155.","journal-title":"Discrete Appl. Math."},{"key":"3733_CR33","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1002\/jgt.10017","volume":"39","author":"J. Foisy","year":"2002","unstructured":"J. Foisy: Intrinsically knotted graphs, J. Graph Theory 39 (2002), 178\u2013187.","journal-title":"J. Graph Theory"},{"key":"3733_CR34","first-page":"197","volume":"25","author":"E. Gethner","year":"2009","unstructured":"E. Gethner and T. Sulanke: Thickness-two graphs, II. More new nine-critical graphs, independence ratio, cloned planar graphs, and singly and doubly outerplanar graphs, Graphs Combin. 25 (2009), 197\u2013217.","journal-title":"II. More new nine-critical graphs, independence ratio, cloned planar graphs, and singly and doubly outerplanar graphs, Graphs Combin."},{"key":"3733_CR35","doi-asserted-by":"publisher","first-page":"1801","DOI":"10.2140\/agt.2014.14.1801","volume":"14","author":"N. Goldberg","year":"2014","unstructured":"N. Goldberg, T. W. Mattman and R. Naimi: Many, many more intrinsically knotted graphs, Algebr. Geom. Topol. 14 (2014), 1801\u20131823.","journal-title":"many more intrinsically knotted graphs, Algebr. Geom. Topol."},{"key":"3733_CR36","doi-asserted-by":"crossref","unstructured":"D. J. Harvey and D. R. Wood: Average degree conditions forcing a minor, Electron. J. Combin. 23 (2016), #P1.42.","DOI":"10.37236\/5321"},{"key":"3733_CR37","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1002\/jgt.20155","volume":"52","author":"F. Havet","year":"2006","unstructured":"F. Havet and J.-S. Sereni: Improper choosability of graphs and maximum average degree, J. Graph Theory 52 (2006), 181\u2013199.","journal-title":"J. Graph Theory"},{"key":"3733_CR38","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1002\/jgt.10069","volume":"41","author":"W. He","year":"2002","unstructured":"W. He, X. Hou, K.-W. Lih, J. Shao, W. Wang and X. Zhu: Edge-partitions of planar graphs and their game coloring numbers. J. Graph Theory 41 (2002), 307\u2013317.","journal-title":"J. Graph Theory"},{"key":"3733_CR39","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1137\/0221055","volume":"21","author":"L. S. Heath","year":"1992","unstructured":"L. S. Heath and A. L. Rosenberg: Laying out graphs using queues, SIAM J. Comput. 21 (1992), 927\u2013958.","journal-title":"SIAM J. Comput."},{"key":"3733_CR40","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.jctb.2018.02.001","volume":"131","author":"K. Hendrey","year":"2018","unstructured":"K. Hendrey and D. R. Wood: The extremal function for Petersen minors, J. Combinatorial Theory Ser. B 131 (2018), 220\u2013253.","journal-title":"J. Combinatorial Theory Ser. B"},{"key":"3733_CR41","first-page":"211","volume":"66","author":"J. P. Hutchinson","year":"1993","unstructured":"J. P. Hutchinson: Coloring ordinary maps, maps of empires and maps of the moon, Math. Mag. 66 (1993), 211\u2013226.","journal-title":"maps of empires and maps of the moon, Math. Mag."},{"key":"3733_CR42","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0167-5060(08)70614-9","volume":"51","author":"J. Ivan\u010do","year":"1992","unstructured":"J. Ivan\u010do: The weight of a graph, Ann. Discrete Math. 51 (1992), 113\u2013116.","journal-title":"Ann. Discrete Math."},{"key":"3733_CR43","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/S0012-365X(99)00278-2","volume":"211","author":"B. Jackson","year":"2000","unstructured":"B. Jackson and G. Ringel: Variations on Ringel's earth-moon problem, Discrete Math. 211 (2000), 233\u2013242.","journal-title":"Discrete Math."},{"key":"3733_CR44","volume-title":"Weakenings of the conjecture of Hadwiger for 8- and 9-chromatic graphs","author":"I. T. Jakobsen","year":"1971","unstructured":"I. T. Jakobsen: Weakenings of the conjecture of Hadwiger for 8- and 9-chromatic graphs, Technical Report 22, Matematisk Institut, Aarhus Universitet, Denmark, 1971."},{"key":"3733_CR45","doi-asserted-by":"publisher","first-page":"207","DOI":"10.7151\/dmgt.1035","volume":"16","author":"S. Jendrol'","year":"1996","unstructured":"S. Jendrol' and T. Madaras: On light subgraphs in plane graphs of minimum degree five, Discuss. Math. Graph Theory 16 (1996), 207\u2013217.","journal-title":"Discuss. Math. Graph Theory"},{"key":"3733_CR46","first-page":"245","volume":"56","author":"S. Jendrol'","year":"2006","unstructured":"S. Jendrol' and M. Tuh\u00e1rsky: A Kotzig type theorem for non-orientable surfaces, Mathematica Slovaca 56 (2006), 245\u2013253.","journal-title":"Mathematica Slovaca"},{"key":"3733_CR47","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/S0012-365X(00)00250-8","volume":"233","author":"S. Jendrol'","year":"2001","unstructured":"S. Jendrol' and H.-J. Voss: Light subgraphs of multigraphs on compact 2-dimensional manifolds, Discrete Math. 233 (2001), 329\u2013351,.","journal-title":"Discrete Math."},{"key":"3733_CR48","first-page":"375","volume-title":"Paul Erd\u0151s and his Mathematics, II","author":"S. Jendrol'","year":"2002","unstructured":"S. Jendrol' and H.-J. Voss: Light subgraphs of graphs embedded in 2-dimensional manifolds of Euler characteristic \u22640, A survey, in: Paul Erd\u0151s and his Mathematics, II, volume 11 of Bolyai Soc. Math. Stud., 375\u2013411. J\u00e1nos Bolyai Math. Soc., 2002."},{"key":"3733_CR49","first-page":"79","volume":"6","author":"C. D. Keys","year":"1975","unstructured":"C. D. Keys: Graphs critical for maximal bookthickness, Pi Mu Epsilon J. 6 (1975), 79\u201384.","journal-title":"Pi Mu Epsilon J."},{"key":"3733_CR50","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1002\/jgt.21886","volume":"81","author":"J. Kim","year":"2016","unstructured":"J. Kim, A. Kostochka and X. Zhu: Improper coloring of sparse graphs with a given girth, II: constructions, J. Graph Theory 81 (2016), 403\u2013413.","journal-title":"J. Graph Theory"},{"key":"3733_CR51","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1017\/S096354830000184X","volume":"5","author":"J. Koml\u00f3s","year":"1996","unstructured":"J. Koml\u00f3s and E. Szemer\u00e9di: Topological cliques in graphs. II, Combin. Probab. Comput. 5 (1996), 79\u201390.","journal-title":"Combin. Probab. Comput."},{"key":"3733_CR52","first-page":"37","volume":"38","author":"A. V. Kostochka","year":"1982","unstructured":"A. V. Kostochka: The minimum Hadwiger number for graphs with a given mean degree of vertices, Metody Diskret. Analiz. 38 (1982), 37\u201358.","journal-title":"Metody Diskret. Analiz."},{"key":"3733_CR53","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BF02579141","volume":"4","author":"A. V. Kostochka","year":"1984","unstructured":"A. V. Kostochka: Lower bound of the Hadwiger number of graphs by their average degree, Combinatorica 4 (1984), 307\u2013316.","journal-title":"Combinatorica"},{"key":"3733_CR54","doi-asserted-by":"publisher","first-page":"4435","DOI":"10.1016\/j.disc.2007.08.041","volume":"308","author":"A. V. Kostochka","year":"2008","unstructured":"A. V. Kostochka and N. Prince: On Ks;t-minors in graphs with given average degree, Discrete Math. 308 (2008), 4435\u20134445.","journal-title":"Discrete Math."},{"key":"3733_CR55","doi-asserted-by":"publisher","first-page":"2637","DOI":"10.1016\/j.disc.2010.03.026","volume":"310","author":"A. V. Kostochka","year":"2010","unstructured":"A. V. Kostochka and N. Prince: Dense graphs have K3;t minors, Discrete Math. 310 (2010), 2637\u20132654.","journal-title":"Discrete Math."},{"key":"3733_CR56","doi-asserted-by":"publisher","first-page":"3517","DOI":"10.1016\/j.disc.2012.08.004","volume":"312","author":"A. V. Kostochka","year":"2012","unstructured":"A. V. Kostochka and N. Prince: On Ks;t-minors in graphs with given average degree, II, Discrete Math. 312 (2012), 3517\u20133522.","journal-title":"Discrete Math."},{"key":"3733_CR57","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s00493-005-0004-8","volume":"25","author":"D. K\u00fchn","year":"2005","unstructured":"D. K\u00fchn and D. Osthus: Complete minors in Ks;s-free graphs, Combinatorica 25 (2005), 49\u201364.","journal-title":"Combinatorica"},{"key":"3733_CR58","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.ejc.2004.02.002","volume":"26","author":"D. K\u00fchn","year":"2005","unstructured":"D. K\u00fchn and D. Osthus: Forcing unbalanced complete bipartite minors, European J. Combin. 26 (2005), 75\u201381.","journal-title":"European J. Combin."},{"key":"3733_CR59","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/S0893-9659(00)00147-6","volume":"14","author":"K.-W. Lih","year":"2001","unstructured":"K.-W. Lih, Z. Song, W. Wang and K. Zhang: A note on list improper coloring planar graphs, Appl. Math. Lett. 14 (2001), 269\u2013273.","journal-title":"Appl. Math. Lett."},{"key":"3733_CR60","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/BF01350657","volume":"178","author":"W. Mader","year":"1968","unstructured":"W. Mader: Homomorphies\u00e4tze f\u00fcr Graphen, Math. Ann. 178 (1968), 154\u2013168.","journal-title":"Math. Ann."},{"key":"3733_CR61","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/PL00007219","volume":"14","author":"P. Mutzel","year":"1998","unstructured":"P. Mutzel, T. Odenthal and M. Scharbrodt: The thickness of graphs: a survey, Graphs Combin. 14 (1998), 59\u201373.","journal-title":"Graphs Combin."},{"key":"3733_CR62","doi-asserted-by":"publisher","first-page":"868","DOI":"10.2178\/jsl\/1278682204","volume":"75","author":"J. Ne\u0161et\u0159il","year":"2010","unstructured":"J. Ne\u0161et\u0159il and P. Ossona de Mendez: First order properties on nowhere dense structures, J. Symb. Log. 75 (2010), 868\u2013887.","journal-title":"J. Symb. Log."},{"key":"3733_CR63","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1016\/j.ejc.2011.01.006","volume":"32","author":"J. Ne\u0161et\u0159il","year":"2011","unstructured":"J. Ne\u0161et\u0159il and P. Ossona de Mendez: On nowhere dense graphs, European J. Combin. 32 (2011), 600\u2013617.","journal-title":"European J. Combin."},{"key":"3733_CR64","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-27875-4","volume-title":"Sparsity (Graphs, Structures, and Algorithms)","author":"J. Ne\u0161et\u0159il","year":"2012","unstructured":"J. Ne\u0161et\u0159il and P. Ossona de Mendez: Sparsity (Graphs, Structures, and Algorithms), volume 28 of Algorithms and Combinatorics, Springer, 2012."},{"key":"3733_CR65","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1016\/j.ejc.2011.09.008","volume":"33","author":"J. Ne\u0161et\u0159il","year":"2011","unstructured":"J. Ne\u0161et\u0159il, P. Ossona de Mendez and D. R. Wood: Characterisations and examples of graph classes with bounded expansion, European J. Combin. 33 (2011), 350\u2013373.","journal-title":"European J. Combin."},{"key":"3733_CR66","doi-asserted-by":"publisher","first-page":"391","DOI":"10.5209\/rev_REMA.2007.v20.n2.16496","volume":"20","author":"M. Ozawa","year":"2007","unstructured":"M. Ozawa and Y. Tsutsumi: Primitive spatial graphs and graph minors, Rev. Mat. Complut. 20 (2007), 391\u2013406.","journal-title":"Rev. Mat. Complut."},{"key":"3733_CR67","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/BF01215922","volume":"17","author":"J. Pach","year":"1997","unstructured":"J. Pach and G. T\u00f3th: Graphs drawn with few crossings per edge, Combinatorica 17 (1997), 427\u2013439.","journal-title":"Combinatorica"},{"key":"3733_CR68","volume-title":"Exploring the Powers of Stacks and Queues via Graph Layouts","author":"S. V. Pemmaraju","year":"1992","unstructured":"S. V. Pemmaraju: Exploring the Powers of Stacks and Queues via Graph Layouts, PhD thesis, Virginia Polytechnic Institute and State University, U.S.A., 1992."},{"key":"3733_CR69","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/j.disc.2004.07.035","volume":"302","author":"J. L. Ram\u00edrez Alfons\u00edn","year":"2005","unstructured":"J. L. Ram\u00edrez Alfons\u00edn: Knots and links in spatial graphs: a survey, Discrete Math. 302 (2005), 225\u2013242.","journal-title":"Discrete Math."},{"key":"3733_CR70","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1017\/S0963548315000073","volume":"25","author":"B. Reed","year":"2016","unstructured":"B. Reed and D. R. Wood: Forcing a sparse minor, Combin. Probab. Comput. 25 (2016), 300\u2013322.","journal-title":"Combin. Probab. Comput."},{"key":"3733_CR71","volume-title":"F\u00e4rbungsprobleme auf Fl\u00e4chen und Graphen","author":"G. Ringel","year":"1959","unstructured":"G. Ringel: F\u00e4rbungsprobleme auf Fl\u00e4chen und Graphen, volume 2 of Mathematische Monographien, VEB Deutscher Verlag der Wissenschaften, Berlin, 1959."},{"key":"3733_CR72","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF02993245","volume":"28","author":"G. Ringel","year":"1965","unstructured":"G. Ringel: Das Geschlecht des vollst\u00e4ndigen paaren Graphen, Abh. Math. Sem. Univ. Hamburg 28 (1965), 139\u2013150.","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"key":"3733_CR73","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF01202354","volume":"13","author":"N. Robertson","year":"1993","unstructured":"N. Robertson, P. D. Seymour and R. Thomas: Hadwiger's conjecture for K6-free graphs, Combinatorica 13 (1993), 279\u2013361.","journal-title":"Combinatorica"},{"key":"3733_CR74","first-page":"125","volume-title":"Graph structure theory. Proc. of AMSIMS-SIAM Joint Summer Research Conf. on Graph Minors","author":"N. Robertson","year":"1993","unstructured":"N. Robertson, P. D. Seymour and R. Thomas: A survey of linkless embeddings, in: N. Robertson and P. D. Seymour, editors, Graph structure theory. Proc. of AMSIMS-SIAM Joint Summer Research Conf. on Graph Minors, volume 147 of Contempory Mathematics, 125\u2013136, American Mathematical Society, 1993."},{"key":"3733_CR75","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1006\/jctb.1995.1031","volume":"64","author":"N. Robertson","year":"1995","unstructured":"N. Robertson, P. Seymour and R. Thomas: Petersen family minors, J. Combin. Theory Ser. B 64 (1995), 155\u2013184.","journal-title":"J. Combin. Theory Ser. B"},{"key":"3733_CR76","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/BFb0071633","volume-title":"Proc. Conf. on Graph Theory","author":"H. Sachs","year":"1983","unstructured":"H. Sachs: On a spatial analogue of Kuratowski's theorem on planar graphs \u2014 an open problem, in: M. Borowiecki, J. W. Kennedy, and M. M. Syslo, editors, Proc. Conf. on Graph Theory, volume 1018 of Lecture Notes in Mathematics, 230\u2013241, Springer, 1983."},{"key":"3733_CR77","first-page":"163","volume-title":"Surveys in combinatorics","author":"A. Schrijver","year":"1997","unstructured":"A. Schrijver: Minor-monotone graph invariants, in: Surveys in combinatorics, volume 241 of London Math. Soc. Lecture Note Ser., 163\u2013196, Cambridge Univ. Press, 1997."},{"key":"3733_CR78","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/BF02086611","volume":"16","author":"F. Shahrokhi","year":"1996","unstructured":"F. Shahrokhi, L. A. Sz\u00e9kely, O. S\u00fdkora and I. Vr\u0165o: Drawings of graphs on surfaces with few crossings, Algorithmica 16 (1996), 118\u2013131.","journal-title":"Algorithmica"},{"key":"3733_CR79","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0012-365X(99)00145-4","volume":"214","author":"R. \u0160krekovski","year":"2000","unstructured":"R. \u0160krekovski: List improper colorings of planar graphs with prescribed girth, Discrete Math. 214 (2000), 221\u2013233.","journal-title":"Discrete Math."},{"key":"3733_CR80","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/j.ejc.2004.02.013","volume":"26","author":"R. Thomas","year":"2005","unstructured":"R. Thomas and P. Wollan: An improved linear edge bound for graph linkages, European J. Combin. 26 (2005), 309\u2013324.","journal-title":"European J. Combin."},{"key":"3733_CR81","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1017\/S0305004100061521","volume":"95","author":"A. Thomason","year":"1984","unstructured":"A. Thomason: An extremal function for contractions of graphs, Math. Proc. Cambridge Philos. Soc. 95 (1984), 261\u2013265.","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"3733_CR82","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1006\/jctb.2000.2013","volume":"81","author":"A. Thomason","year":"2001","unstructured":"A. Thomason: The extremal function for complete minors, J. Combin. Theory Ser. B 81 (2001), 318\u2013338.","journal-title":"J. Combin. Theory Ser. B"},{"key":"3733_CR83","first-page":"37","volume-title":"Ten years LNMB","author":"H. Holst van der","year":"1997","unstructured":"H. van der Holst: On the graph parameters of Colin de Verdi\u00e8re, in: Ten years LNMB, 37\u201344, Math. Centrum Centrum Wisk. Inform., Amsterdam, 1997."},{"key":"3733_CR84","first-page":"29","volume-title":"Graph theory and Combinatorial Biology","author":"H. Holst van der","year":"1999","unstructured":"H. van der Holst, L. Lov\u00e1sz and A. Schrijver: The Colin de Verdi\u00e8re graph parameter, in: Graph theory and Combinatorial Biology, volume 7 of Bolyai Soc. Math. Stud., 29\u201385, J\u00e1nos Bolyai Math. Soc., 1999."},{"key":"3733_CR85","doi-asserted-by":"publisher","first-page":"2029","DOI":"10.1137\/120885140","volume":"27","author":"Y. Wang","year":"2013","unstructured":"Y. Wang and L. Xu: Improper choosability of planar graphs without 4-cycles, SIAM J. Discrete Math. 27 (2013), 2029\u20132037.","journal-title":"SIAM J. Discrete Math."},{"key":"3733_CR86","doi-asserted-by":"crossref","unstructured":"D. R. Wood: Cliques in graphs excluding a complete graph minor, Electron. J. Combin. 23 (2016), #P3.18.","DOI":"10.37236\/5715"},{"key":"3733_CR87","doi-asserted-by":"crossref","unstructured":"R. G. Wood and D. R. Woodall: Defective choosability of graphs without small minors. Electron. J. Combin. 16 (2009), #R92.","DOI":"10.37236\/181"},{"key":"3733_CR88","doi-asserted-by":"publisher","first-page":"441","DOI":"10.7151\/dmgt.1557","volume":"31","author":"D. R. Woodall","year":"2011","unstructured":"D. R. Woodall: Defective choosability of graphs in surfaces, Discuss. Math. Graph Theory 31 (2011), 441\u2013459.","journal-title":"Discuss. Math. Graph Theory"},{"key":"3733_CR89","volume-title":"Thickness for improper colorings","author":"M. Yancey","year":"2012","unstructured":"M. Yancey: Thickness for improper colorings, 2012, http:\/\/www.math.illinois.edu\/~dwest\/regs\/impthic.html ."},{"key":"3733_CR90","first-page":"339","volume":"54","author":"H. Zhang","year":"2013","unstructured":"H. Zhang: On (4, 1)*-choosability of toroidal graphs without chordal 7-cycles and adjacent 4-cycles, Commentationes Mathematicae Universitatis Carolinae 54 (2013), 339\u2013344.","journal-title":"Commentationes Mathematicae Universitatis Carolinae"},{"key":"3733_CR91","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/s12044-016-0272-9","volume":"126","author":"H. Zhang","year":"2016","unstructured":"H. Zhang: (3, 1)*-choosability of graphs of nonnegative characteristic without intersecting short cycles, Proceedings\u2013Mathematical Sciences 126 (2016), 159\u2013165.","journal-title":"Proceedings\u2013Mathematical Sciences"},{"key":"3733_CR92","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1016\/j.dam.2011.10.019","volume":"160","author":"L. Zhang","year":"2012","unstructured":"L. Zhang: A (3, 1)*-choosable theorem on toroidal graphs, Discrete Appl. Math. 160 (2012), 332\u2013338.","journal-title":"Discrete Appl. Math."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-018-3733-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-018-3733-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-018-3733-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T09:58:30Z","timestamp":1693821510000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-018-3733-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,14]]},"references-count":92,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["3733"],"URL":"https:\/\/doi.org\/10.1007\/s00493-018-3733-1","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,8,14]]},"assertion":[{"value":"2 December 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 September 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 August 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}