𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hamiltonian Paths in Cartesian Powers of Directed Cycles

✍ Scribed by David Austin; Heather Gavlas; Dave Witte

Book ID
106047463
Publisher
Springer Japan
Year
2003
Tongue
English
Weight
269 KB
Volume
19
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

When the cartesian product of directed c
When the cartesian product of directed cycles is Hamiltonian
✍ William T. Trotter Jr.; Paul ErdΓΆs πŸ“‚ Article πŸ“… 1978 πŸ› John Wiley and Sons 🌐 English βš– 225 KB

The Cartesian product of two hamiltonian graphs is always hamiltonian. For directed graphs, the analogous statement is false. We show that the Cartesian product C,,, x C, , of directed cycles is hamiltonian if and only if the greatest common divisor (g.c.d.) d of n, and n, is a t least two and there

Generalized hamiltonian circuits in the
Generalized hamiltonian circuits in the cartesian product of two-directed cycles
✍ Douglas S. Jungreis πŸ“‚ Article πŸ“… 1988 πŸ› John Wiley and Sons 🌐 English βš– 299 KB

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 2, @ 2,. This is a generalization of the results known for r = 0 or 1. In 1978, Trotter and Erdos [3] gave a necessary and sufficient condition f

When the cartesian product of two direct
When the cartesian product of two directed cycles is hypo-Hamiltonian
✍ Laurence E. Penn; David Witte πŸ“‚ Article πŸ“… 1983 πŸ› John Wiley and Sons 🌐 English βš– 150 KB

We show that the Cartesian product Z, x Z, of two directed cycles is hypo-Hamiltonian (Hamiltonian) if and only if there is a pair of relatively prime positive integers m and n with ma + nb = ab -1 (ma + nb = ab). The result for hypo-Hamiltonian is new; that for Hamiltonian is known. These are speci

Powers of Hamiltonian paths in interval
Powers of Hamiltonian paths in interval graphs
✍ Isaak, Garth πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 232 KB πŸ‘ 3 views

We give a simple proof that the obvious necessary conditions for a graph to contain the k th power of a Hamiltonian path are sufficient for the class of interval graphs. The proof is based on showing that a greedy algorithm tests for the existence of Hamiltonian path powers in interval graphs. We wi

Hamiltonian paths and cycles in hypertou
Hamiltonian paths and cycles in hypertournaments
✍ Gutin, Gregory; Yeo, Anders πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 138 KB

Given two integers n and k, n β‰₯ k > 1, a k-hypertournament T on n vertices is a pair (V, A), where V is a set of vertices, |V | = n and A is a set of k-tuples of vertices, called arcs, so that for any k-subset S of V, A contains exactly one of the k! k-tuples whose entries belong to S. A 2-hypertour