%0 Book Section
%@ 978-3-642-00790-3
%A Young, H.P.
%B Polyhedral Combinatorics
%C Germany
%D 2009
%E Balinski, M. L.
%E Hoffman, A.J.
%F iiasa:14040
%I Springer Berlin Heidelberg
%P 128-140
%R 10.1007/BFb0121198
%S Mathematical Programming Studies
%T On permutations and permutation polytopes
%U https://pure.iiasa.ac.at/id/eprint/14040/
%V 8
%X An easy characterization is given of neighbors on permutation polytopes. Using this characterization it is shown that the graph of any such polytope is Hamiltonian, and that the diameter is two.