{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T12:33:20Z","timestamp":1772368400903,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2018,10,10]],"date-time":"2018-10-10T00:00:00Z","timestamp":1539129600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100009226","name":"National Security Agency","doi-asserted-by":"publisher","award":["H98230-16-1-0324"],"award-info":[{"award-number":["H98230-16-1-0324"]}],"id":[{"id":"10.13039\/100009226","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":[[2018,11]]},"DOI":"10.1007\/s00373-018-1962-0","type":"journal-article","created":{"date-parts":[[2018,10,10]],"date-time":"2018-10-10T07:53:42Z","timestamp":1539158022000},"page":"1395-1409","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Counterexample Regarding Labelled Well-Quasi-Ordering"],"prefix":"10.1007","volume":"34","author":[{"given":"Robert","family":"Brignall","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Engen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Vatter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,10]]},"reference":[{"issue":"1\u20133","key":"1962_CR1","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/S0012-365X(98)00162-9","volume":"195","author":"MD Atkinson","year":"1999","unstructured":"Atkinson, M.D.: Restricted permutations. Discret. Math. 195(1\u20133), 27\u201338 (1999)","journal-title":"Discret. Math."},{"key":"1962_CR2","unstructured":"Atminas, A., Brignall, R., Lozin, V., Stacho, J.: Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs. \n                    arXiv:1503.01628\n                    \n                   [math.CO]"},{"issue":"3","key":"1962_CR3","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s11083-014-9333-9","volume":"32","author":"A Atminas","year":"2015","unstructured":"Atminas, A., Lozin, V.: Labelled induced subgraphs and well-quasi-ordering. Order 32(3), 313\u2013328 (2015)","journal-title":"Order"},{"key":"1962_CR4","first-page":"129","volume":"19","author":"DM Avis","year":"1981","unstructured":"Avis, D.M., Newborn, M.: On pop-stacks in series. Utilitas Math. 19, 129\u2013140 (1981)","journal-title":"Utilitas Math."},{"issue":"2","key":"1962_CR5","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0012-365X(85)90040-8","volume":"55","author":"C Benzaken","year":"1985","unstructured":"Benzaken, C., Hammer, P.L., de Werra, D.: Split graphs of Dilworth number \n                    \n                      \n                    \n                    $$2$$\n                    \n                      \n                        \n                          2\n                        \n                      \n                    \n                  . Discret. Math. 55(2), 123\u2013127 (1985)","journal-title":"Discret. Math."},{"issue":"5","key":"1962_CR6","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0020-0190(97)00209-3","volume":"65","author":"P Bose","year":"1998","unstructured":"Bose, P., Buss, J.F., Lubiw, A.: Pattern matching for permutations. Inform. Process. Lett. 65(5), 277\u2013283 (1998)","journal-title":"Inform. Process. Lett."},{"key":"1962_CR7","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719796","volume-title":"Graph Classes: A Survey","author":"A Brandst\u00e4dt","year":"1999","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia (1999)"},{"issue":"4","key":"1962_CR8","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s00493-008-2314-0","volume":"28","author":"R Brignall","year":"2008","unstructured":"Brignall, R., Huczynska, S., Vatter, V.R.: Decomposing simple permutations, with enumerative consequences. Combinatorica 28(4), 385\u2013400 (2008)","journal-title":"Combinatorica"},{"issue":"3","key":"1962_CR9","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s11083-010-9174-0","volume":"27","author":"J Daligault","year":"2010","unstructured":"Daligault, J., Rao, M., Thomass\u00e9, S.: Well-quasi-order of relabel functions. Order 27(3), 301\u2013315 (2010)","journal-title":"Order"},{"issue":"4","key":"1962_CR10","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1002\/jgt.3190140406","volume":"14","author":"P Damaschke","year":"1990","unstructured":"Damaschke, P.: Induced subgraphs and well-quasi-ordering. J. Graph Theory 14(4), 427\u2013435 (1990)","journal-title":"J. Graph Theory"},{"key":"1962_CR11","doi-asserted-by":"publisher","first-page":"600","DOI":"10.2307\/2371374","volume":"63","author":"B Dushnik","year":"1941","unstructured":"Dushnik, B., Miller, E.W.: Partially ordered sets. Am. J. Math. 63, 600\u2013610 (1941)","journal-title":"Am. J. Math."},{"key":"1962_CR12","first-page":"311","volume":"14","author":"S F\u00f6ldes","year":"1977","unstructured":"F\u00f6ldes, S., Hammer, P.L.: Split graphs. Congr. Numer. 14, 311\u2013315 (1977)","journal-title":"Congr. Numer."},{"issue":"3","key":"1962_CR13","doi-asserted-by":"publisher","first-page":"666","DOI":"10.4153\/CJM-1977-069-1","volume":"29","author":"S F\u00f6ldes","year":"1977","unstructured":"F\u00f6ldes, S., Hammer, P.L.: Split graphs having Dilworth number two. Can. J. Math. 29(3), 666\u2013672 (1977)","journal-title":"Can. J. Math."},{"key":"1962_CR14","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF02020961","volume":"18","author":"T Gallai","year":"1967","unstructured":"Gallai, T.: Transitiv orientierbare Graphen. Acta Math. Acad. Sci. Hungar. 18, 25\u201366 (1967)","journal-title":"Acta Math. Acad. Sci. Hungar."},{"issue":"2","key":"1962_CR15","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","volume":"3","author":"G Higman","year":"1952","unstructured":"Higman, G.: Ordering by divisibility in abstract algebras. Proc. Lond. Math. Soc. 3(2), 326\u2013336 (1952)","journal-title":"Proc. Lond. Math. Soc."},{"key":"1962_CR16","unstructured":"Homberger, C., Pantone, J.: PermPy. \n                    http:\/\/permpy.com\/\n                    \n                   (2017)"},{"key":"1962_CR17","doi-asserted-by":"crossref","unstructured":"Huczynska, S., Ru\u0161kuc, N.: Well quasi-order in combinatorics: embeddings and homomorphisms. In: Czumaj, A., Georgakopoulos, A., Kr\u00e1l\u2019, D., Lozin, V., Pikhurko, O. (eds.) Surveys in Combinatorics 2015, vol.\u00a0424 of London Mathematical Society Lecture Note Series, pp.\u00a0261\u2013293. Cambridge University Press, Cambridge (2015)","DOI":"10.1017\/CBO9781316106853.009"},{"key":"1962_CR18","unstructured":"Information System on Graph Classes and their Inclusions (ISGCI). Published electronically at \n                    http:\/\/www.graphclasses.org\/"},{"issue":"3","key":"1962_CR19","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1007\/s00373-013-1290-3","volume":"30","author":"N Korpelainen","year":"2014","unstructured":"Korpelainen, N., Lozin, V., Mayhill, C.: Split permutation graphs. Graphs Combin. 30(3), 633\u2013646 (2014)","journal-title":"Graphs Combin."},{"issue":"3","key":"1962_CR20","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1007\/s11083-012-9272-2","volume":"30","author":"N Korpelainen","year":"2013","unstructured":"Korpelainen, N., Lozin, V., Razgon, I.: Boundary properties of well-quasi-ordered sets of graphs. Order 30(3), 723\u2013735 (2013)","journal-title":"Order"},{"key":"1962_CR21","unstructured":"Murphy, M.M.: Restricted Permutations, Antichains, Atomic Classes, and Stack Sorting. PhD thesis, University of St Andrews (2002). \n                    http:\/\/hdl.handle.net\/10023\/11023"},{"key":"1962_CR22","unstructured":"Pouzet, M.: Un bel ordre d\u2019abritement et ses rapports avec les bornes d\u2019une multirelation. C. R. Acad. Sci. Paris S\u00e9r. A-B 274, A1677\u2013A1680 (1972)"},{"key":"1962_CR23","unstructured":"Robertson, N., Seymour, P.: Graph minors I\u2013XX. J. Combin. Theory Ser. B (1983\u20132004)"},{"issue":"1\u20133","key":"1962_CR24","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0012-365X(94)90242-9","volume":"132","author":"ZE Stankova","year":"1994","unstructured":"Stankova, Z.E.: Forbidden subsequences. Discret. Math. 132(1\u20133), 291\u2013316 (1994)","journal-title":"Discret. Math."},{"key":"1962_CR25","first-page":"754","volume-title":"Handbook of Enumerative Combinatorics","author":"VR Vatter","year":"2015","unstructured":"Vatter, V.R.: Permutation classes. In: B\u00f3na, M. (ed.) Handbook of Enumerative Combinatorics, pp. 754\u2013833. CRC Press, Boca Raton (2015)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-018-1962-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1962-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1962-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,9]],"date-time":"2019-10-09T19:19:15Z","timestamp":1570648755000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-018-1962-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,10]]},"references-count":25,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["1962"],"URL":"https:\/\/doi.org\/10.1007\/s00373-018-1962-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10,10]]},"assertion":[{"value":"28 September 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 September 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 October 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}