Related papers: Constructing Two Edge-Disjoint Hamiltonian Cycles …

In 1979, Shearer and Kleitman conjectured that there exist $\lfloor n/2 \rfloor+1$ orthogonal chain decompositions of the hypercube $Q_n$, and constructed two orthogonal chain decompositions. In this paper, we make the first non-trivial…

The incidence matrix of a graph is totally unimodular if and only if the graph is bipartite, i.e., it contains no odd cycles. We extend the characterization of total unimodularity to hypergraphs whose hyperedges of size at least four are…

We analyze chiral topological edge modes in a non-Hermitian variant of the 2D Dirac equation. Such modes appear at interfaces between media with different "masses" and/or signs of the "non-Hermitian charge". The existence of these edge…

In this work we present an algorithm with which any arbitrary cubic planar map may be constructed through successive edge insertion while simultaneously constructing a set of proper edge labels and Hamiltonian cycles for each configuration.…

We describe an algorithm for the exhaustive generation of non-isomorphic graphs with a given number $k \ge 0$ of hamiltonian cycles, which is especially efficient for small $k$. Our main findings, combining applications of this algorithm…

Modular trapped-ion quantum computing hardware, known as QCCDs require shuttling operations in order to maintain effective all-to-all connectivity. Each module or trap can perform only one operation at a time, resulting in low intra-trap…

A long-standing conjecture of Kelly states that every regular tournament on n vertices can be decomposed into (n-1)/2 edge-disjoint Hamilton cycles. We prove this conjecture for large n. In fact, we prove a far more general result, based on…

We give an algorithmic proof for the existence of tight Hamilton cycles in a random r-uniform hypergraph with edge probability p=n^{-1+eps} for every eps>0. This partly answers a question of Dudek and Frieze [Random Structures Algorithms],…

A $c$-edge-colored multigraph has each edge colored with one of the $c$ available colors and no two parallel edges have the same color. A proper Hamiltonian cycle is a cycle containing all the vertices of the multigraph such that no two…

The use of skew polynomial rings allows to endow linear codes with cyclic structures which are not cyclic in the classical (commutative) sense. Whenever these skew cyclic structures are carefully chosen, some control over the Hamming…

The natural infinite analogue of a (finite) Hamilton cycle is a two-way-infinite Hamilton path (connected spanning 2-valent subgraph). Although it is known that every connected $2k$-valent infinite circulant graph has a two-way-infinite…

We show that for all $k\geq 4$, $\varepsilon >0$, and $n$ sufficiently large, every $k$-uniform hypergraph on $n$ vertices in which each set of $k-3$ vertices is contained in at least $(5/8 + \varepsilon) \binom{n}{3}$ edges contains a…

Using a vector field in $\mathbb{R}^4$, we provide an example of a robust heteroclinic cycle between two equilibria that displays a mix of features exhibited by well-known types of low-dimensional heteroclinic structures, including simple,…

The varietal hypercube $VQ_n$ is a variant of the hypercube $Q_n$ and has better properties than $Q_n$ with the same number of edges and vertices. This paper proves that $VQ_n$ is vertex-transitive. This property shows that when $VQ_n$ is…

We present fast and efficient randomized distributed algorithms to find Hamiltonian cycles in random graphs. In particular, we present a randomized distributed algorithm for the $G(n,p)$ random graph model, with number of nodes $n$ and…

We introduce a new setting of algorithmic problems in random graphs, studying the minimum number of queries one needs to ask about the adjacency between pairs of vertices of ${\mathcal G}(n,p)$ in order to typically find a subgraph…

In the parallel processing field, graph embedding is motivated by simulation interconnection networks to another. The quadtree is an important technique used to present spatial data and is used in many application domains, especially…

Finding Hamitonian Cycles in square grid graphs is a well studied and important questions. More recent work has extended these results to triangular and hexagonal grids, as well as further restricted versions. In this paper, we examine a…

In 1975, Erd\H{o}s asked for the maximum number of edges that an $n$-vertex graph can have if it does not contain two edge-disjoint cycles on the same vertex set. It is known that Tur\'an-type results can be used to prove an upper bound of…

A graph is Hamiltonian if it contains a cycle which visits every vertex of the graph exactly once. In this paper, we consider the problem of Hamiltonicity of a graph $G_n$, which will be called the prime difference graph of order $n$, with…