A. , S. Arnborg, D. Corneil, and A. Proskurowski, Complexity of nding embeddings in and k-tree, SIAM J. Algebraic Discrete Methods, vol.8, issue.2, pp.277-284, 1987.

A. K. Abrahamson, N. Dadoun, D. G. Kirkpatrick, and T. Przytycka, A simple parallel tree contraction algorithm, Journal of Algorithms, vol.10, issue.2, pp.287-302, 1989.
DOI : 10.1016/0196-6774(89)90017-5

A. , S. Arnborg, J. Lagergren, and D. Seese, Easy problems for treedecomposable graphs, J. Algorithms, vol.12, pp.308-340, 1991.

G. Behrendt, Maximal antichains in partially ordered sets, Ars Combin, vol.25, 1988.

L. Hans, T. Bodlaender, and . Kloks, Better algorithms for the pathwidth and treewidth of graphs, ICA91] 544{555. BW85], 1991.

E. Bender and H. S. Wilf, A theoretical analysis of backtracking in the graph coloring problem, Journal of Algorithms, vol.6, issue.2, pp.275-282, 1985.
DOI : 10.1016/0196-6774(85)90044-6

C. , B. Courcelle, and M. Mosbah, Monadic second-order evaluations on treedecomposable graphs A linear recognition algorithm for cographs, WG91], pp.14-926, 1985.

D. Damaschke, Induced subgraphs and well-quasi-ordering, Journal of Graph Theory, vol.59, issue.4, pp.427-435, 1990.
DOI : 10.1002/jgt.3190140406

R. P. Dilworth, Some combinatorial problems on partially ordered sets, 13{18. DIL90], 1958.
DOI : 10.1090/psapm/010/0115940

D. D. Duuus, M. Pouzet, and I. , Complete ordered sets with no innnite antichains , Discrete Math, pp.39-52, 1981.

E. Ebbinghaus, Einf uhrung in die Mengenlehre, Wissenschaftliche Buchgeselllschaft, 1979.

R. Michael and . Fellows, The Robertson-Seymour theorems: a survey of applications, see GA89], pp.1-18, 1989.

R. Michael, N. G. Fellows, M. A. Kinnersley, and . Langston, Finite-basis theorems and a computation-integrated approach to obstruction set isolation, p.85, 1988.

R. Michael, M. A. Fellows, and . Langston, Nonconstructive advances in polynomial-time complexity, Inform. Process. Lett, 1985.

R. Michael, M. A. Fellows, and . Langston, Layout permutation problems and well-partially-ordered sets, Proceedings of the 5 th MIT Conference on Advanced Research in VLSI, pp.315-327, 1988.

R. Michael, M. A. Fellows, and . Langston, Nonconstructive tools for proving polynomial-time decidability, J. Assoc. Comput. Mach, vol.35, issue.3, pp.727-739, 1988.

R. Michael, M. A. Fellows, and . Langston, On search, decision and the eeciency of polomial-time algorithms, 1988.

R. Michael, M. A. Fellows, and . Langston, An analogue of the Myhill-Nerode theorem and its use in computing nite-basis characterizations, see FOC89, 1989.

R. Michael, M. A. Fellows, and . Langston, On well-partial-order theory and its application to combinatorial problems of VLSI design, SIAM J. Disc. Math, vol.5, issue.1, pp.117-126, 1992.

C. Martin and . Golumbic, Algorithmic Graph Theory and Perfect Graphs, 1980.

J. Gus89 and . Gustedt, On the pathwidth of chordal graphs, Discrete Appl. Math, 1989.

J. Gustedt, Well-quasi-ordering nite posets and formal languages, 1991.

J. Gustedt, Well-quasi-ordering nite posets, accepted for publication in GM91, 1992.

G. Higman, Ordering by Divisibility in Abstract Algebras, Proc. London Math. Soc
DOI : 10.1112/plms/s3-2.1.326

M. Habib and R. H. Ohring, On some complexity properties of N-free posets and posets with bounded decomposition diameter, Discrete Math, pp.157-182, 1987.

J. Lag90 and . Lagergren, EEcient parallel algorithms for tree-decomposition and related problems, see FOC90, 1990.

J. D. Lawson, M. Mislove, and H. A. Priestley, Innnite chains in semilattices, pp.275-290, 1985.

L. , R. Lin, and S. Olariu, An NC recognition algorithm for cographs Complexity of scheduling under precedence constraints, Operations Res, Discrete Appl. Math, pp.26-48, 1978.

]. E. Mil85 and . Milner, Basic wqo-and bqo-theory, 1985.

R. H. and R. M. Uller, A combinatorial approach to obtain bounds for stochastic project neworks, 1992.

R. H. Ohring, Computationally tractable classes of ordered sets, pp.105-194, 1989.

L. Gary, J. H. Miller, and . Reif, Parallel tree contraction and its application, FOC85], pp.478-489, 1985.

R. H. Ohring and F. J. Radermacher, The order-theoretic approach to scheduling: The deterministic case, APS89] 29{66. NR87], 1989.

J. Ne and V. , Complexity of diagrams On well-quasi-ordering nite trees, 321{ 330 Math. Proc. Cambridge Philos. Soc, pp.59-833, 1963.

M. Pouzet, Applications of Well Quasi-Ordering and Better Quasi-Ordering, pp.503-519, 1985.
DOI : 10.1007/978-94-009-5315-4_15

J. Hans, A. Pr-omel, and . Steger, Allmost all Berge graphs are perfect, Combinatorics, Probability and Computing, 1992.

J. Hans, A. Pr-omel, and . Steger, Coloring clique-free graphs in linear expected time, Random Structures and Algorithms, 1992.

A. Bruce and . Reed, Finding approximate separators and computing tree width quickly, private communication, 1991.

K. Reuter, The jump number and the lattice of maximal antichains, Discrete Mathematics, vol.88, issue.2-3, 1991.
DOI : 10.1016/0012-365X(91)90016-U

N. Robertson and P. Seymour, Graph minors. I. Excluding a forest, Journal of Combinatorial Theory, Series B, vol.35, issue.1, pp.39-61, 1983.
DOI : 10.1016/0095-8956(83)90079-5
URL : http://doi.org/10.1006/jctb.1999.1919

N. Robertson and P. Seymour, Graph minors. III. Planar tree-width, Journal of Combinatorial Theory, Series B, vol.36, issue.1, pp.49-64, 1983.
DOI : 10.1016/0095-8956(84)90013-3
URL : http://doi.org/10.1006/jctb.1999.1919

N. Robertson and P. Seymour, Graph minors ??? a survey, Surveys in Combinatorics, pp.153-171, 1985.
DOI : 10.1017/CBO9781107325678.009

N. Robertson and P. Seymour, Graph minors XI, distance on a surface, Manuscript, 1985.

N. Robertson and P. Seymour, Graph minors. II. Algorithmic aspects of tree-width, Journal of Algorithms, vol.7, issue.3, pp.309-322, 1986.
DOI : 10.1016/0196-6774(86)90023-4
URL : http://doi.org/10.1006/jctb.1999.1919

N. Robertson and P. Seymour, Graph minors. V. Excluding a planar graph, Journal of Combinatorial Theory, Series B, vol.41, issue.1
DOI : 10.1016/0095-8956(86)90030-4
URL : http://doi.org/10.1006/jctb.1999.1919

N. Robertson and P. Seymour, Graph minors. VI. Disjoint paths across a disc, Journal of Combinatorial Theory, Series B, vol.41, issue.1, pp.115-138, 1986.
DOI : 10.1016/0095-8956(86)90031-6
URL : http://doi.org/10.1006/jctb.1999.1919

N. Robertson and P. Seymour, Graph minors XII, excluding a non-planar graph, Manuscript, 1986.

N. Robertson and P. Seymour, Graph Minors .XIII. The Disjoint Paths Problem, Journal of Combinatorial Theory, Series B, vol.63, issue.1, 1986.
DOI : 10.1006/jctb.1995.1006
URL : http://doi.org/10.1006/jctb.1999.1919

N. Robertson and P. Seymour, Graph minors XIV, taming a vortex, Manuscript, 1987.

N. Robertson and P. Seymour, Graph minors. VII. Disjoint paths on a surface, Journal of Combinatorial Theory, Series B, vol.45, issue.2, pp.212-254, 1988.
DOI : 10.1016/0095-8956(88)90070-6

N. Robertson and P. Seymour, Graph minors XV, Wagner's conjecture, Manuscript, 1988.

N. Robertson and P. Seymour, Graph minors XVI, well-quasi-ordering on a surface, Manuscript, 1989.

N. Robertson and P. Seymour, Graph minors. IV. Tree-width and well-quasi-ordering, Journal of Combinatorial Theory, Series B, vol.48, issue.2, pp.227-254, 1990.
DOI : 10.1016/0095-8956(90)90120-O

N. Robertson and P. Seymour, Graph minors. IX. Disjoint crossed paths, Journal of Combinatorial Theory, Series B, vol.49, issue.1
DOI : 10.1016/0095-8956(90)90063-6

N. Robertson and P. Seymour, Graph minors. VIII. A kuratowski theorem for general surfaces, Journal of Combinatorial Theory, Series B, vol.48, issue.2, pp.255-288, 1990.
DOI : 10.1016/0095-8956(90)90121-F
URL : http://doi.org/10.1006/jctb.1999.1919

N. Robertson and P. Seymour, An outline of a disjoint paths algorithm Graph minors X, obstructions to treedecomposition, J. Combin. Theory Ser. B, vol.52, pp.90-153, 1990.

A. Ste92 and . Steger, An O(1) average time algorithm for perfectness, private communication, 1992.

J. D. Ullman, NP-complete scheduling problems, 384{393. WG91] Graph-Theoretic Concepts in Computer Science 17th International Workshop WG '91, 1975.
DOI : 10.1016/S0022-0000(75)80008-0

H. S. Wilf, Backtrack: An O(1) expected time algorithm for the graph coloring problem, Information Processing Letters, vol.18, issue.3, pp.119-121, 1984.
DOI : 10.1016/0020-0190(84)90013-9