Adjacency of vertices of the complete pre-order polytope

Discrete Mathematics

Volumn 175, Issue 1-3, 1997, Pages 163-172

  Gurgel, Maria Angela C M ^a   Wakabayashi, Yoshiko ^a  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

Author keywords

Adjacency of vertices; Complete pre order; Diameter; Polytope

Indexed keywords

EID: 0039969786     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(96)00143-4     Document Type: Article

References (12)

1. J.A. Bondy and U.S.R. Murty, Graph Theory with Applications (Macmillan, London, 1976).
2. A. Brøndsted, An Introduction to Convex Polytopes (Springer, New York, 1982).
3. B. Grünbaum, Convex Polytopes (Wiley, New York, 1970).
4. M.A.C.M. Gurgel and Y. Wakabayashi, The complete pre-order polytope: facets and separation problem, Tech. Report RT-MAC 9306, Univ. of São Paulo, Brazil, 1993.
5. F. Harary, Graph Theory (Addison-Wesley, Reading, MA, 1969).
6. D. Hausmann, Adjacency on Polytopes in Combinatorial Optimization (Verlag A. Hain, Meisenheim, Germany, 1980).
7. M.W. Padberg and M.R. Rao, The travelling salesman problem and a class of polyhedra of diameter two, Math. Programming 7 (1974) 32-45.
8. C.H. Papadimitriou, The adjacency relation on the travelling salesman problem is NP-complete, Math. Programming 14 (1978) 312-324.
9. W.R. Pulleyblank, Polyhedral combinatorics, in: G.L. Nemhauser, A.H.G. Rinnooy Kan, M.J. Todd, eds., Optimization, Handbooks in Operations Research and Management Science, vol. 1 (North-Holland, Amsterdam, 1989).
10. H.P. Young, On permutations and permutation polytopes, Math. Programming Study 8 (1978) 128-140.
11. Y. Wakabayashi, Adjacency of vertices of the clique partitioning polytope, SCIENTIA, Series A: Mathematical Sciences, Universidad Técnica Federico Santa Maria, Valparaiso, Chile, vol. 3 (1989) 111-119.
12. Y. Wakabayashi, Medians of binary relations: computational complexity, Tech. Report SC-92 Zentrüm für Informationstechnik Berlin, Germany, 1992.