ON WELL-QUASI-ORDERING FINITE SEQUENCES

被引:1
|
作者
BOLLERHOFF, U [1 ]
机构
[1] UNIV HANOVER,INST MATH,D-3000 HANOVER 1,FED REP GER
关键词
D O I
10.1016/S0195-6698(89)80055-1
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
引用
收藏
页码:227 / 230
页数:4
相关论文
共 50 条
  • [21] Labelled Induced Subgraphs and Well-Quasi-Ordering
    Atminas, Aistis
    Lozin, Vadim V.
    ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS, 2015, 32 (03): : 313 - 328
  • [22] Bipartite Induced Subgraphs and Well-Quasi-Ordering
    Korpelainen, Nicholas
    Lozin, Vadim V.
    JOURNAL OF GRAPH THEORY, 2011, 67 (03) : 235 - 249
  • [23] Labelled Induced Subgraphs and Well-Quasi-Ordering
    Aistis Atminas
    Vadim V. Lozin
    Order, 2015, 32 : 313 - 328
  • [24] A Counterexample Regarding Labelled Well-Quasi-Ordering
    Robert Brignall
    Michael Engen
    Vincent Vatter
    Graphs and Combinatorics, 2018, 34 : 1395 - 1409
  • [25] Integer packing sets form a well-quasi-ordering
    Del Pia, Alberto
    Gijswijt, Dion
    Linderoth, Jeff
    Zhu, Haoran
    OPERATIONS RESEARCH LETTERS, 2021, 49 (02) : 226 - 230
  • [26] Strong immersion is a well-quasi-ordering for semicomplete digraphs
    Barbero, Florian
    Paul, Christophe
    Pilipczuk, Michal
    JOURNAL OF GRAPH THEORY, 2019, 90 (04) : 484 - 496
  • [27] Two forbidden induced subgraphs and well-quasi-ordering
    Korpelainen, Nicholas
    Lozin, Vadim
    DISCRETE MATHEMATICS, 2011, 311 (16) : 1813 - 1822
  • [28] Well-quasi-ordering versus clique-width
    Lozin, Vadim
    Razgon, Igor
    Zamaraev, Viktor
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2018, 130 : 1 - 18
  • [29] WELL-QUASI-ORDERING OF COUNTABLE SERIES-PARALLEL ORDERS
    THOMASSE, S
    COMPTES RENDUS DE L ACADEMIE DES SCIENCES SERIE I-MATHEMATIQUE, 1993, 317 (10): : 909 - 912
  • [30] GRAPHS WITHOUT K4 AND WELL-QUASI-ORDERING
    THOMAS, R
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1985, 38 (03) : 240 - 247