<mods:mods version="3.3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd" xmlns:mods="http://www.loc.gov/mods/v3" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"><mods:titleInfo><mods:title>On permutations and permutation polytopes</mods:title></mods:titleInfo><mods:name type="personal"><mods:namePart type="given">H.P.</mods:namePart><mods:namePart type="family">Young</mods:namePart><mods:role><mods:roleTerm type="text">author</mods:roleTerm></mods:role></mods:name><mods:abstract>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.</mods:abstract><mods:originInfo><mods:dateIssued encoding="iso8601">2009</mods:dateIssued></mods:originInfo><mods:originInfo><mods:publisher>Springer Berlin Heidelberg</mods:publisher></mods:originInfo><mods:genre>Book Section</mods:genre></mods:mods>