Minimal antichains in well-founded quasi-orders with an application to tournaments

Journal of Combinatorial Theory. Series B

Volumn 80, Issue 2, 2000, Pages 258-276

  Cherlin, Gregory L ^a   Latka, Brenda J ^b  

^a RUTGERS UNIVERSITY   (United States)

^b LAFAYETTE COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034311696     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.2000.1986     Document Type: Article

References (24)

1. Alekseev V. E., Korobitsyn D. V. Complexity of some problems on hereditary classes of graphs. Diskret. Mat. 4:1992;34-40.
2. Bredon G. Topology and Geometry. Graduate Texts in Mathematics. 139:1993;Springer-Verlag, New York. p. 13.
3. Burlet M., Fonlupt J. Polynomial algorithm to recognize a Meyniel graph. Berge C., Chvátal V. Topics on Perfect Graphs. 1984;225-252 North Holland, Amsterdam.
4. Cherlin G. L. The classification of countable homogeneous directed graphs and countable homogeneous n-tournaments. Mem. Amer. Math. Soc. 131:1998.
5. Cherlin G. L. Combinatorial problems connected with finitely homogeneous structures. Contemp. Math. 131:1992;3-30.
6. Cherlin G. L. Homogeneous directed graphs. Sauer N., Woodrow R., Sands B. Finite and Infinite Combinatorics in Sets and Logic. NATO ASI Series C: Mathematical and Physical Sciences. 411:1993;81-95 Kluwer Academic, Norwell.
7. Cherlin G. L., Latka B. J. DIMACS Technical Report. June 1996.
8. Chvátal V., Sbihi N. Recognizing perfect graphs. J. Combin. Theory Ser. B. 44:1988;154-176.
9. Corneil D. G., Fonlupt J. Stable set bonding in perfect graphs and parity graphs. J. Combin. Theory Ser. B. 59:1993;1-14.
10. Erdos P., Moser L. A problem on tournaments. Canad. Math Bull. 7:1964;351-356.
11. Fellows M., Langston M. On well-partial-order theory and its application to combinatorial problems of VLSI design. SIAM J. Discrete Math. 5:1992;117-126.
12. Gustedt J. Algorithmic Aspects of Ordered Structures. 1992;Technische Universität Berlin.
13. Ward Henson C. Countable homogeneous relational systems and categorical theories. J. Symbol. Logic. 37:1972;494-500.
14. Higman G. Ordering by divisibility in abstract algebras. Proc. London Math. Soc. 2:1952;326-336.
15. Hsu W. L. Recognizing planar perfect graphs. J. Assoc. Comput. Machinery. 34:1987;25-288.
16. Jenkyns T. A., Nash-Williams C. St. J. A. Counterexamples in the theory of well-quasi-ordered sets. Proc. 2nd Ann Arbor Graph Theory Conf. 1968;. p. 87-91.
17. Johnson D. S. The NP-completeness column, an ongoing guide. J. Algorithms. 8:1987;285-303.
18. Latka B. J. Finitely constrained classes of homogeneous directed graphs. J. Symbol. Logic. 59:1994;124-139.
19. Latka B. J. Tournaments, embeddings, and well-quasi-orderings. Graph Theory, Combinatorics, and Applications, Proc. 7th Quadrennial International Conference on the Theory and Applications of Graphs. 1995;. p. 685-696.
20. 5, preprint.
21. 3), preprint.
22. Latka B. J. Well-quasi-ordered classes of tournament. Proc. 8th Quadrennial International Conference on Graph Theory, Combinatorics, Algorithms, and Applications. 1999;. p. 597-606.
23. Nash-Williams C. St. J. A. On well-quasi-ordering finite trees. Proc. Cambridge Philos. Soc. 59:1963;833-835.
24. Truemper K., Soun Y. Minimal forbidden subgraphs of unimodular multicommodity networks. Math. Oper. Res. 4:1979;379-389.