• Corpus ID: 247594601

Arc-disjoint hamiltonian paths in Cartesian products of directed cycles

  title={Arc-disjoint hamiltonian paths in Cartesian products of directed cycles},
  author={Iren Darijani and Babak Miraftab and Dave Witte Morris},
. We show that if C 1 and C 2 are directed cycles (of length at least two), then the Cartesian product C 1 (cid:3) C 2 has two arc-disjoint hamiltonian paths. (This answers a question asked by J. A.Gallian in 1985.) The same conclusion also holds for the Cartesian product of any four or more directed cycles (of length at least two), but some cases remain open for the Cartesian product of three directed cycles. We also discuss the existence of arc-disjoint hamiltonian paths in 2-generated Cayley… 

Figures from this paper

Hamiltonicity in generalized quasi-dihedral groups

Witte Morris showed in [21] that every connected Cayley graph of a finite (generalized) dihedral group has a Hamiltonian path. The infinite dihedral group is defined as the free product with



When the cartesian product of directed cycles is Hamiltonian

It is shown that the cartesian product C, x C„ 2 of directed cycles is hamiltonian if and only if the greatest common divisor ofn, and n2 is at least two and there exist positive integers d,, d2 so thatd, + d2= d and g.c.d.d.(n,,d,) = g.

Hamilton Paths in Cartesian Products of Directed Cycles

Infinite Hamiltonian paths in Cayley digraphs

Hamilton decompositions of one-ended Cayley graphs

On Cayley Digraphs That Do Not Have Hamiltonian Paths

We construct an infinite family of connected, -generated Cayley digraphs that do not have hamiltonian paths, such that the orders of the generators and are unbounded. We also prove that if is any

Generalized hamiltonian circuits in the cartesian product of two-directed cycles

We find necessary and sufficient conditions for the existence of a closed walk that traverses r vertices twice and the rest once in the Cayley digraph of Zm ⊕ Zn. This is a generalization of the

On Hamilton decompositions of infinite circulant graphs

The problem of decomposing 2k-valent infinite circulant graphs into k edge-disjoint two-way-infinite Hamilton paths for k=2, in many cases when k=3, and in many other cases including where the connection set is ±{1,2,...,k}.

Enumeration of hamiltonian paths in Cayley diagrams

LetG be a group generated by a subset of elementsS. The Cayley diagram ofG givenS is the labeled directed graph with vertices identified with the elements ofG and (v, u) is an edge labeledh ifh ∈S