Linear programming duality and morphisms

Commentationes Mathematicae Universitatis Carolinae

Volumn 40, Issue 3, 1999, Pages 577-592

  Hochstättler, Winfried ^a   Neŝetril, Jaroslav ^b  

^a UNIVERSITY OF COLOGNE   (Germany)

^b CHARLES UNIVERSITY   (Czech Republic)

Author keywords

Duality; Homomorphisms; Oriented matroids; Strong maps

Indexed keywords

EID: 4243796536     PISSN: 00102628     EISSN: 12137243     Source Type: Journal    
DOI: None     Document Type: Article

References (24)

1. Bachem A., KernW Linear Programming Duality: An Introduction to Oriented Matroids, Springer, Berlin etc., 1992
2. Bacik R., Mahajan S Interactive proof systems and polynomial algorithms, preprint
3. Björner A., Las Vergnas M., Sturmfels B., White N., Ziegler G.M Oriented Matroids, Encyclopedia of Mathematics and its Applications 46, Cambridge University Press, 1993
4. Bland R.G., Dietrich B.L An abstract duality, Discrete Math. 70 (1988), 203-208
5. Bland R.G., Las Vergnas M Orientability of matroids, J. Combin. Theory Ser. B 24 (1978), 94-123
6. Edmonds J Paths, trees and flowers, Canadian J. Math. 17 (1965), 449-467
7. Farkas G Theorie der einfachen Ungleichungen, J. Reine Angew. Math. 124 (1902), 1-27
8. Feder T., Vardi M.Y Monotone Monadic SNP and Constraint Satisfaction, Proc. 25th ACM STOC 1993, pp. 612-622
9. Folkman J., Lawrence J Oriented matroids, J. Combin. Theory Ser. B 25 (1978), 199-236
10. Grötschel M., Lovász L., Schrijver A The ellipsoid method and its consequences in com-binatorial optimization, Combinatorica 1 (1981), 169-197
11. Hell P., Zhu X Homomorphisms to oriented paths, Discrete Math. 132 (1994), 107-114
12. Hell P., Nešetřil J., Zhu X Duality and polynomial testing of tree homomorphisms, Trans. Amer. Math. Soc. 348 (1996), 1281-1297
13. Hell P., Nešetřil J., Zhu X Complexity of tree homomorphisms, submitted
14. Hochstättler W A note on the Weak Zone Theorem, Congressus Numerantium 98 (1993), 95-103
15. Hoffman A.J., Schwartz D.E On partitions of partially ordered sets, J. Combin. Theory Ser. B 23 (1977), 3-13
16. Hoffman A.J On lattice polyhedra, Proceedings 5th Hungarian Coll. on Combinatorics, North Holland, 1978, pp. 593-598
17. Komarek P Some new good characterizations of directed graphs, Časopis Pěst. Mat. 51 (1984), 348-354
18. Komarek P Good characterizations, Thesis, Charles University, Prague, 1983
19. Lovász L., Schrijver A oral communication
20. Minty G.J On the axiomatic foundations of the theories of directed linear graphs, electrical networks and network-programming, J. Math. and Mechanics 15 (1966), 485-520
21. Nešetřil J., Pultr A On classes of relations and graphs determined by subobjects and factorobjects, Discrete Math. 22 (1978), 287-300
22. Nešetřil J Theory of Graphs, SNTL, Praha, 1979
23. Schrijver A Theory of Linear and Integer Programming, Wiley-Interscience, Chichester, 1986
24. White N. (editor) Theory of Matroids, Encyclopedia of Mathematics and its Applications 26, Cambridge University Press, 1986