Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Kruskal, J. B.
1960.
Well-quasi-ordering, the Tree Theorem, and Vazsonyi’s conjecture.
Transactions of the American Mathematical Society,
Vol. 95,
Issue. 2,
p.
210.
Nash-Williams, C. St. J. A.
1965.
On well-quasi-ordering transfinite sequences.
Mathematical Proceedings of the Cambridge Philosophical Society,
Vol. 61,
Issue. 1,
p.
33.
Nash-Williams, C. St. J. A.
1965.
On well-quasi-ordering infinite trees.
Mathematical Proceedings of the Cambridge Philosophical Society,
Vol. 61,
Issue. 3,
p.
697.
Nash-Williams, C. St. J. A.
1968.
On better-quasi-ordering transfinite sequences.
Mathematical Proceedings of the Cambridge Philosophical Society,
Vol. 64,
Issue. 2,
p.
273.
Kruskal, Joseph B
1972.
The theory of well-quasi-ordering: A frequently discovered concept.
Journal of Combinatorial Theory, Series A,
Vol. 13,
Issue. 3,
p.
297.
Laver, Richard
1976.
Well-quasi-orderings and sets of finite sequences.
Mathematical Proceedings of the Cambridge Philosophical Society,
Vol. 79,
Issue. 1,
p.
1.
Duffus, D.
Pouzet, M.
and
Rival, I.
1981.
Complete ordered sets with no infinite antichains.
Discrete Mathematics,
Vol. 35,
Issue. 1-3,
p.
39.
Shelah, Saharon
1982.
Better quasi-orders for uncountable cardinals.
Israel Journal of Mathematics,
Vol. 42,
Issue. 3,
p.
177.
1982.
Linear Orderings.
Vol. 98,
Issue. ,
p.
174.
Milner, E. C.
and
Pouzet, M.
1985.
The erd�s-dushnik-miller theorem for topological graphs and orders.
Order,
Vol. 1,
Issue. 3,
p.
249.
Finkel, A.
1985.
Une généralisation des théorèmes de Higman et de Simon aux mots infinis.
Theoretical Computer Science,
Vol. 38,
Issue. ,
p.
137.
Milner, E. C.
1985.
Graphs and Order.
p.
487.
1986.
Theory of Relations.
Vol. 118,
Issue. ,
p.
373.
Dershowitz, Nachum
1987.
Termination of rewriting.
Journal of Symbolic Computation,
Vol. 3,
Issue. 1-2,
p.
69.
Thomas, Robin
1989.
Well-quasi-ordering infinite graphs with forbidden finite planar minor.
Transactions of the American Mathematical Society,
Vol. 312,
Issue. 1,
p.
279.
Kříž, Igor
and
Thomas, Robin
1990.
On well-quasi-ordering finite structures with labels.
Graphs and Combinatorics,
Vol. 6,
Issue. 1,
p.
41.
Prömel, Hans Jürgen
and
Voigt, Bernd
1992.
From wqo to bqo, via Ellentuck's theorem.
Discrete Mathematics,
Vol. 108,
Issue. 1-3,
p.
83.
Pouzet, Maurice
1993.
Finite and Infinite Combinatorics in Sets and Logic.
p.
313.
2000.
Theory of Relations.
Vol. 145,
Issue. ,
p.
417.
Goubault-Larrecq, Jean
2007.
On Noetherian Spaces.
p.
453.