ON WELL-QUASI-ORDERING FINITE SEQUENCES

被引：1

作者：

BOLLERHOFF, U ^{[1
]}

机构：

[1] UNIV HANOVER,INST MATH,D-3000 HANOVER 1,FED REP GER

来源：

EUROPEAN JOURNAL OF COMBINATORICS | 1989年 / 10卷 / 03期

关键词：

D O I：

10.1016/S0195-6698(89)80055-1

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：227 / 230

页数：4

共 50 条

[31] Branch-width and well-quasi-ordering in matroids and graphs
Geelen, JF
Gerards, AMH
Whittle, G
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2002, 84 (02) : 270 - 290
[32] Well-quasi-ordering H-contraction-free graphs
Kaminski, Marcin
Raymond, Jean-Florent
Trunck, Theophile
DISCRETE APPLIED MATHEMATICS, 2018, 248 : 18 - 27
[33] Well-quasi-ordering Does Not Imply Bounded Clique-width
Lozin, Vadim V.
Razgon, Igor
Zamaraev, Viktor
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2016, 9224 : 351 - 359
[34] Graph minors. XIX. Well-quasi-ordering on a surface
Robertson, N
Seymour, PD
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2004, 90 (02) : 325 - 385
[35] Loop checking in SLD-derivations by well-quasi-ordering of goals
Pacini, G
Sessa, MI
THEORETICAL COMPUTER SCIENCE, 2000, 238 (1-2) : 221 - 246
[36] Well-quasi-ordering Friedman ideals of finite trees proof of Robertson's magic-tree conjecture
Bowler, Nathan
Nigussie, Yared
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2024, 164 : 222 - 244
[37] GRAPH MINORS .4. TREE-WIDTH AND WELL-QUASI-ORDERING
ROBERTSON, N
SEYMOUR, PD
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1990, 48 (02) : 227 - 254
[38] Well-quasi-ordering digraphs with no long alternating paths by the strong immersion relation
Liu, Chun -Hung
Muzi, Irene
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2023, 158 : 210 - 251
[39] Well-quasi-ordering of matrices under Schur complement and applications to directed graphs
Kante, Mamadou Moustapha
EUROPEAN JOURNAL OF COMBINATORICS, 2012, 33 (08) : 1820 - 1841
[40] Graph minors. XVIII. Tree-decompositions and well-quasi-ordering
Robertson, N
Seymour, P
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2003, 89 (01) : 77 - 108

← 1 2 3 4 5 →