Ara es mostren els items 25-26 de 26

    • Showing non-realizability of spheres by distilling a tree 

      Pfeifle, Julián (2021)
      Text en actes de congrés
      Accés obert
      In [Zhe20a], Hailun Zheng constructs a combinatorial 3-sphere on 16 vertices whose graph is the complete 4-partite graph K4;4;4;4. Such a sphere seems unlikely to be realizable as the boundary complex of a 4-dimensional ...
    • The rotation graph of k-ary trees is Hamiltonian 

      Huemer, Clemens; Hurtado Díaz, Fernando Alfredo; Pfeifle, Julián (Crete University Press, 2006)
      Article
      Accés restringit per política de l'editorial
      In this paper we show that the graph of k-ary trees, connected by rotations, contains a Hamilton cycle. Our proof is constructive and thus provides a cyclic Gray code for k-ary trees. Furthermore, we identify a basic ...