{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T05:22:06Z","timestamp":1776316926915,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T00:00:00Z","timestamp":1284508800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Order"],"published-print":{"date-parts":[[2010,11]]},"DOI":"10.1007\/s11083-010-9174-0","type":"journal-article","created":{"date-parts":[[2010,9,14]],"date-time":"2010-09-14T06:46:15Z","timestamp":1284446775000},"page":"301-315","source":"Crossref","is-referenced-by-count":20,"title":["Well-Quasi-Order of Relabel Functions"],"prefix":"10.1007","volume":"27","author":[{"given":"Jean","family":"Daligault","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Rao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phan","family":"Thomass\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,9,15]]},"reference":[{"key":"9174_CR1","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/0022-0000(93)90004-G","volume":"46","author":"B Courcelle","year":"1993","unstructured":"Courcelle, B., Engelfriet, J., Rozenberg, G.: Handle-rewriting Hypergraph grammars. J. Comput. Syst. Sci. 46, 218\u2013270 (1993)","journal-title":"J. Comput. Syst. Sci."},{"key":"9174_CR2","doi-asserted-by":"crossref","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, 427\u2013435 (1990)","journal-title":"J. Graph Theory"},{"key":"9174_CR3","unstructured":"Fra\u00efss\u00e9, R.: Theory of relations. In: Studies in Logic, vol. 118. North Holland (1986)"},{"key":"9174_CR4","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/j.tcs.2006.12.010","volume":"372","author":"F Gurski","year":"2007","unstructured":"Gurski, F.: Characterizations for restricted graphs of NLC-width 2. Theor. Comput. Sci. 372, 108\u2013114 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"9174_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/11604686_7","volume-title":"Proceedings of Graph-Theoretical Concepts in Computer Science","author":"F Gurski","year":"2005","unstructured":"Gurski, F., Wanke, E.: Minimizing NLC-width is NP-complete (extended abstract). In: Proceedings of Graph-Theoretical Concepts in Computer Science. Lecture Notes in Computer Science, vol. 3787, pp. 69\u201380. Springer, Berlin (2005)"},{"key":"9174_CR6","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","volume":"2","author":"G Higman","year":"1952","unstructured":"Higman, G.: Ordering by divisibility in abstract algebras. Proc. Lond. Math. Soc. 2, 326\u2013336 (1952)","journal-title":"Proc. Lond. Math. Soc."},{"key":"9174_CR7","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1142\/S0129054100000223","volume":"11","author":"O Johansson","year":"2000","unstructured":"Johansson, O.: NLC2-Decomposition in polynomial time. Int. J. Found. Comput. Sci. 11, 373\u2013395 (2000)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"12","key":"9174_CR8","doi-asserted-by":"crossref","first-page":"2747","DOI":"10.1016\/j.dam.2008.08.022","volume":"157","author":"M Kaminski","year":"2009","unstructured":"Kaminski, M., Lozin, V.V., Milanic, M.: Recent developments on graphs of bounded clique-width. Discrete Appl. Math. 157(12), 2747\u20132761 (2009)","journal-title":"Discrete Appl. Math."},{"key":"9174_CR9","doi-asserted-by":"crossref","first-page":"215","DOI":"10.2307\/1971481","volume":"130","author":"I Kriz","year":"1989","unstructured":"Kriz, I.: Well-quasiordering finite trees with gap-condition. Proof of Harvey Friedman\u2019s conjecture. Ann. Math. 130, 215\u2013226 (1989)","journal-title":"Ann. Math."},{"key":"9174_CR10","first-page":"59","volume":"55","author":"I Kriz","year":"1991","unstructured":"Kriz, I., Sgall, J.:Well-quasi-ordering depends on the labels. Acta Sci. Math. 55, 59\u201365 (1991)","journal-title":"Acta Sci. Math."},{"key":"9174_CR11","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF01787479","volume":"6","author":"I Kriz","year":"1990","unstructured":"Kriz, I., Thomas, R.: On well-quasi-ordering finite structures with labels. Graphs Comb. 6, 41\u201349 (1990)","journal-title":"Graphs Comb."},{"key":"9174_CR12","first-page":"210","volume":"95","author":"JB Kruskal","year":"1960","unstructured":"Kruskal, J.B.: Well-quasi-ordering, the tree theorem, and Vazsonyi\u2019s conjecture. Trans. Am. Math. Soc. 95, 210\u2013225 (1960)","journal-title":"Trans. Am. Math. Soc."},{"key":"9174_CR13","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0097-3165(72)90063-5","volume":"13","author":"JB Kruskal","year":"1972","unstructured":"Kruskal, J.B.: The theory of well-quasi-ordering, a frequently rediscovered concept. J. Comb. Theory, Ser. A 13, 297\u2013305 (1972)","journal-title":"J. Comb. Theory, Ser. A"},{"key":"9174_CR14","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1017\/S0305004100039062","volume":"61","author":"C Nash-Williams","year":"1965","unstructured":"Nash-Williams, C.St.J.A.: On well-quasi-ordering infinite trees. Math. Proc. Camb. Philos. Soc. 61, 697\u2013720 (1965)","journal-title":"Math. Proc. Camb. Philos. Soc."},{"key":"9174_CR15","first-page":"1677","volume":"274","author":"M Pouzet","year":"1972","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\u2013B 274, 1677\u20131680 (1972)","journal-title":"C. R. Acad. Sci., Paris S\u00e9r. A\u2013B"},{"key":"9174_CR16","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/j.jctb.2004.08.001","volume":"92","author":"N Robertson","year":"2004","unstructured":"Robertson, N., Seymour, P.: Graph Minors. XX. Wagner\u2019s conjecture. J. Comb. Theory, Ser. B 92, 325\u2013357 (2004)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"9174_CR17","doi-asserted-by":"crossref","first-page":"2491","DOI":"10.1090\/S0002-9947-99-02400-9","volume":"352","author":"S Thomass\u00e9","year":"2000","unstructured":"Thomass\u00e9, S.: On better-quasi-ordering countable series-parallel orders. Trans. Am. Math. Soc. 352, 2491\u20132505 (2000)","journal-title":"Trans. Am. Math. Soc."},{"key":"9174_CR18","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0166-218X(94)90026-4","volume":"54","author":"E Wanke","year":"1994","unstructured":"Wanke, E.: k-NLC graphs and polynomial algorithms. Discrete Appl. Math. 54, 251\u2013266 (1994)","journal-title":"Discrete Appl. Math."}],"container-title":["Order"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-010-9174-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11083-010-9174-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-010-9174-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T05:12:14Z","timestamp":1559365934000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11083-010-9174-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9,15]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,11]]}},"alternative-id":["9174"],"URL":"https:\/\/doi.org\/10.1007\/s11083-010-9174-0","relation":{},"ISSN":["0167-8094","1572-9273"],"issn-type":[{"value":"0167-8094","type":"print"},{"value":"1572-9273","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9,15]]}}}