Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
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.
Hajnal, A.
and
Milner, E. C.
1971.
Some theorems for scattered ordered sets.
Periodica Mathematica Hungarica,
Vol. 1,
Issue. 2,
p.
81.
Laver, Richard
1976.
Well-quasi-orderings and sets of finite sequences.
Mathematical Proceedings of the Cambridge Philosophical Society,
Vol. 79,
Issue. 1,
p.
1.
Andreaf, Thomas
1978.
On a problem of R. Halin concerning infinite graphs.
Discrete Mathematics,
Vol. 23,
Issue. 1,
p.
1.
Landraitis, Charles
1979.
A combinatorial property of the homomorphism relation between countable order types.
Journal of Symbolic Logic,
Vol. 44,
Issue. 3,
p.
403.
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.
Seymour, P.D.
and
Robertson, Neil
1984.
Orders: Description and Roles - In Set Theory, Lattices, Ordered Groups, Topology, Theory of Models and Relations, Combinatorics, Effectiveness, Social Sciences, Proceedings of the Conference on Ordered Sets and their Application Château dc la Tourcttc; Ordres: Description et Rôles - En Théorie des Treillis, des Groupes Ordonnés; en Topologie, Théorie des Modèles et des Relations, Cornbinatoire, Effectivité, Sciences Sociales, Actes de la Conférence sur ies Ensembles Ordonnés et leur Applications Château de la Tourette.
Vol. 99,
Issue. ,
p.
343.
Pouzet, Maurice
and
Zaguia, Nejib
1984.
Ordered sets with no chains of ideals of a given type.
Order,
Vol. 1,
Issue. 2,
p.
159.
Pouzet, M.
1985.
Graphs and Order.
p.
592.
Milner, E. C.
1985.
Graphs and Order.
p.
487.
Almeida, Jorge
1985.
Some quasi-ordered classes of finite commutative semigroups.
Semigroup Forum,
Vol. 32,
Issue. 1,
p.
189.
1986.
Theory of Relations.
Vol. 118,
Issue. ,
p.
373.
Andreae, Thomas
1986.
On well-quasi-ordering-finite graphs by immersion.
Combinatorica,
Vol. 6,
Issue. 4,
p.
287.
Dershowitz, Nachum
1987.
Termination of rewriting.
Journal of Symbolic Computation,
Vol. 3,
Issue. 1-2,
p.
69.
Kozen, Dexter
1988.
A finite model theorem for the propositional ?-calculus.
Studia Logica,
Vol. 47,
Issue. 3,
p.
233.
Thomas, Robin
1988.
A counter-example to ‘Wagner's conjecture’ for infinite graphs.
Mathematical Proceedings of the Cambridge Philosophical Society,
Vol. 103,
Issue. 1,
p.
55.
Fellows, Michael R.
and
Langston, Michael A.
1988.
VLSI Algorithms and Architectures.
Vol. 319,
Issue. ,
p.
278.
Fellows, Michael R.
and
Langston, Michael A.
1988.
Nonconstructive tools for proving polynomial-time decidability.
Journal of the ACM,
Vol. 35,
Issue. 3,
p.
727.
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.