par Buekenhout, Francis ;Parker, Monique
Référence Discrete mathematics, 186, 1-3, page (69-94)
Publication Publié, 1998-05
Article révisé par les pairs
Résumé : Classifying the nets (also called unfoldings or developments or patterns) of the regular convex polytopes under the isometry group of the polytope is equivalent to classifying the spanning trees of the facet-adjacency graph under its automorphism group. This is done for all such polytopes of dimension at most 4. © 1998 Elsevier Science B.V. All rights reserved.