Edge-disjoint Hamiltonian cycles in two-dimensional torus

The torus is one of the popular topologies for the interconnecting processors to build high-performance multicomputers. This paper presents methods to generate edge-disjoint Hamiltonian cycles in 2D tori

Long path and cycle decompositions of even hypercubes

We consider edge decompositions of the $n$-dimensional hypercube $Q_n$ into isomorphic copies of a given graph $H$. While a number of results are known about decomposing $Q_n$ into graphs from various classes, the simplest cases of paths and cycles of a given length are far from being understood. A conjecture of Erde asserts that if $n$ is even, $\ell < 2^n$ and $\ell$ divides the number of edges of $Q_n$, then the path of length $\ell$ decomposes $Q_n$. Tapadia et al.\ proved that any path of length $2^mn$, where $2^m<n$, satisfying these conditions decomposes $Q_n$. Here, we make progress toward resolving Erde's conjecture by showing that cycles of certain lengths up to $2^{n+1}/n$ decompose $Q_n$. As a consequence, we show that $Q_n$ can be decomposed into copies of any path of length at most $2^{n}/n$ dividing the number of edges of $Q_n$, thereby settling Erde's conjecture up to a linear factor

Hamiltonian Cycles in Polyhedral Maps

We present a necessary and sufficient condition for existence of a contractible, non-separating and noncontractible separating Hamiltonian cycle in the edge graph of polyhedral maps on surfaces. In particular, we show the existence of contractible Hamiltonian cycle in equivelar triangulated maps. We also present an algorithm to construct such cycles whenever it exists.Comment: 14 page

Coadjoint orbits of symplectic diffeomorphisms of surfaces and ideal hydrodynamics

We give a classification of generic coadjoint orbits for the groups of symplectomorphisms and Hamiltonian diffeomorphisms of a closed symplectic surface. We also classify simple Morse functions on symplectic surfaces with respect to actions of those groups. This gives an answer to V.Arnold's problem on describing all invariants of generic isovorticed fields for the 2D ideal fluids. For this we introduce a notion of anti-derivatives on a measured Reeb graph and describe their properties.Comment: 38 pages, 11 figures; to appear in Annales de l'Institut Fourie

Single-Strip Triangulation of Manifolds with Arbitrary Topology

Triangle strips have been widely used for efficient rendering. It is NP-complete to test whether a given triangulated model can be represented as a single triangle strip, so many heuristics have been proposed to partition models into few long strips. In this paper, we present a new algorithm for creating a single triangle loop or strip from a triangulated model. Our method applies a dual graph matching algorithm to partition the mesh into cycles, and then merges pairs of cycles by splitting adjacent triangles when necessary. New vertices are introduced at midpoints of edges and the new triangles thus formed are coplanar with their parent triangles, hence the visual fidelity of the geometry is not changed. We prove that the increase in the number of triangles due to this splitting is 50% in the worst case, however for all models we tested the increase was less than 2%. We also prove tight bounds on the number of triangles needed for a single-strip representation of a model with holes on its boundary. Our strips can be used not only for efficient rendering, but also for other applications including the generation of space filling curves on a manifold of any arbitrary topology.Comment: 12 pages, 10 figures. To appear at Eurographics 200