{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T13:06:47Z","timestamp":1752671207586},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"S1","license":[{"start":{"date-parts":[[2022,10,10]],"date-time":"2022-10-10T00:00:00Z","timestamp":1665360000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,10]],"date-time":"2022-10-10T00:00:00Z","timestamp":1665360000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s00493-021-4767-3","type":"journal-article","created":{"date-parts":[[2022,10,10]],"date-time":"2022-10-10T11:51:55Z","timestamp":1665402715000},"page":"1049-1079","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Vertex-Minor-Closed Classes are \u03c7-Bounded"],"prefix":"10.1007","volume":"42","author":[{"given":"James","family":"Davies","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,10]]},"reference":[{"key":"4767_CR1","doi-asserted-by":"crossref","unstructured":"M. Bonamy and M. Pilipczuk: Graphs of bounded cliquewidth are polynomially X-bounded, Advances in Combinatorics 8 (2020).","DOI":"10.19086\/aic.13668"},{"key":"4767_CR2","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1006\/jctb.1994.1008","volume":"60","author":"A Bouchet","year":"1994","unstructured":"A. Bouchet: Circle graph obstructions, Journal of Combinatorial Theory, Series B 60 (1994), 107\u2013144.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"4767_CR3","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/j.jctb.2018.08.009","volume":"135","author":"H Choi","year":"2019","unstructured":"H. Choi, O. Kwon, S. Oum and P. Wollan: Chi-boundedness of graph classes excluding wheel vertex-minors, Journal of Combinatorial Theory, Series B 135 (2019), 319\u2013348.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"4767_CR4","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.jctb.2016.11.007","volume":"123","author":"I Choi","year":"2017","unstructured":"I. Choi, O. Kwon and S. Oum: Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors, Journal of Combinatorial Theory, Series B 123 (2017), 126\u2013147.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"4767_CR5","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.jctb.2021.05.001","volume":"150","author":"M Chudnovsky","year":"2021","unstructured":"M. Chudnovsky, A. Scott and P. Seymour: Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings, Journal of Combinatorial Theory, Series B 150 (2021), 195\u2013243.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"4767_CR6","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.jctb.2019.05.001","volume":"140","author":"M Chudnovsky","year":"2020","unstructured":"M. Chudnovsky, A. Scott, P. Seymour and S. Spirkl: Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes, Journal of Combinatorial Theory, Series B 140 (2020), 84\u201397.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"4767_CR7","unstructured":"J. Davies: Coloring vertex-minor-free graphs, Master\u2019s thesis, University of Warwick, 2019."},{"key":"4767_CR8","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1112\/blms.12447","volume":"53","author":"J Davies","year":"2021","unstructured":"J. Davies and R. McCarty: Circle graphs are quadratically x-bounded, Bulletin of the London Mathematical Society 53 (2021), 673\u2013679.","journal-title":"Bulletin of the London Mathematical Society"},{"key":"4767_CR9","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1016\/j.ejc.2011.12.005","volume":"33","author":"Z Dvo\u0159\u00e1k","year":"2012","unstructured":"Z. Dvo\u0159\u00e1k and D. Kr\u00e1l\u2019: Classes of graphs with small rank decompositions are X-bounded, European Journal of Combinatorics 33 (2012), 679\u2013683.","journal-title":"European Journal of Combinatorics"},{"key":"4767_CR10","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0095-8956(86)90028-6","volume":"41","author":"P Erd\u0151s","year":"1986","unstructured":"P. Erd\u0151s, M. Saks and V. S\u00f3s: Maximum induced trees in graphs, Journal of Combinatorial Theory, Series B 41 (1986), 61\u201379.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"4767_CR11","unstructured":"L. Esperet and R. de Joannis de Verclos: Personal Communication, 2018."},{"key":"4767_CR12","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1016\/j.jctb.2008.10.001","volume":"99","author":"J Fox","year":"2009","unstructured":"J. Fox, P. S. Loh and B. Sudakov: Large induced trees in Kr-free graphs, Journal of Combinatorial Theory, Series B, 99 (2009), 494\u2013501.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"4767_CR13","unstructured":"J. Geelen: Personal Communication, 2020."},{"key":"4767_CR14","unstructured":"J. Geelen, O. Kwon, R. McCarty and P. Wollan: The grid theorem for vertex-minors, Journal of Combinatorial Theory, Series B (2020)."},{"key":"4767_CR15","volume-title":"Algorithmic graph theory and perfect graphs","author":"M Golumbic","year":"2004","unstructured":"M. Golumbic: Algorithmic graph theory and perfect graphs, second ed., vol. 57, Elsevier Science B.V., Amsterdam, 2004.","edition":"second ed."},{"key":"4767_CR16","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0012-365X(85)90044-5","volume":"55","author":"A Gy\u00e1rf\u00e1s","year":"1985","unstructured":"A. Gy\u00e1rf\u00e1s: On the chromatic number of multiple interval graphs and overlap graphs, Discrete mathematics 55 (1985), 161\u2013166.","journal-title":"Discrete mathematics"},{"key":"4767_CR17","unstructured":"A. Gy\u00e1rf\u00e1s: Problems from the world surrounding perfect graphs, Number 177. MTA Sz\u00e1mit\u00e1stechnikai \u00e9s Automatiz\u00e1l\u00e1si Kutat\u00f3 Int\u00e9zet, 1985."},{"key":"4767_CR18","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1016\/j.jctb.2019.06.001","volume":"140","author":"R Kim","year":"2020","unstructured":"R. Kim, O. Kwon, S. Oum and V. Sivaraman: Classes of graphs with no long cycle as a vertex-minor are polynomially x-bounded, Journal of Combinatorial Theory, Series B 140 (2020), 372\u2013386.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"4767_CR19","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1090\/conm\/342\/06137","volume":"342","author":"A Kostochka","year":"2004","unstructured":"A. Kostochka: Coloring intersection graphs of geometric figures with a given clique number, Contemporary mathematics 342 (2004), 127\u2013138.","journal-title":"Contemporary mathematics"},{"key":"4767_CR20","first-page":"204","volume":"10","author":"A Kostochka","year":"1988","unstructured":"A. Kostochka: Upper bounds on the chromatic number of graphs, Transactions of the Institute of Mathematics (Siberian Branch of the Academy of Sciences of USSR), 10 (1988), 204\u2013226 (in Russian).","journal-title":"Transactions of the Institute of Mathematics (Siberian Branch of the Academy of Sciences of USSR)"},{"key":"4767_CR21","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.jctb.2005.03.003","volume":"95","author":"S Oum","year":"2005","unstructured":"S. Oum: Rank-width and vertex-minors, Journal of Combinatorial Theory, Series B 95 (2005), 79\u2013100.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"4767_CR22","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1016\/j.jctb.2013.11.001","volume":"105","author":"A Pawlik","year":"2014","unstructured":"A. Pawlik, J. Kozik, T. Krawczyk, M. Laso\u0144, P. Micek, W. T. Trotter and B. Walczak: Triangle-free intersection graphs of line segments with large chromatic number, Journal of Combinatorial Theory, Series B 105 (2014), 6\u201310.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"4767_CR23","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1002\/(SICI)1097-0118(199704)24:4<297::AID-JGT2>3.0.CO;2-J","volume":"24","author":"A Scott","year":"1997","unstructured":"A. Scott: Induced trees in graphs of large chromatic number, Journal of Graph Theory 24 (1997), 297\u2013311.","journal-title":"Journal of Graph Theory"},{"key":"4767_CR24","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.1007\/s00493-019-3804-y","volume":"39","author":"A Scott","year":"2019","unstructured":"A. Scott and P. Seymour: Induced subgraphs of graphs with large chromatic number. X. Holes of specific residue, Combinatorica 39 (2019), 1105\u20131132.","journal-title":"Combinatorica"},{"key":"4767_CR25","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1002\/jgt.22601","volume":"95","author":"A Scott","year":"2020","unstructured":"A. Scott and P. Seymour: A survey of x-boundedness, Journal of Graph Theory 95 (2020), 473\u2013504.","journal-title":"Journal of Graph Theory"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-021-4767-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-021-4767-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-021-4767-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,2]],"date-time":"2023-02-02T16:33:22Z","timestamp":1675355602000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-021-4767-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,10]]},"references-count":25,"journal-issue":{"issue":"S1","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["4767"],"URL":"https:\/\/doi.org\/10.1007\/s00493-021-4767-3","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,10]]},"assertion":[{"value":"9 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 September 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 October 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}