๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Edge exchanges in hamiltonian decompositions of Kronecker-product graphs

โœ Scribed by P.K. Jha; N. Agnihotri; R. Kumar

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
572 KB
Volume
31
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Pseudo-cartesian product and hamiltonian
Pseudo-cartesian product and hamiltonian decompositions of Cayley graphs on abelian groups
โœ Cong Fan; Don R. Lick; Jiuqiang Liu ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 971 KB

Alspach has conjectured that any 2k-regular connected Cayley graph cay(A,S) on a finite abelian group A can be decomposed into k hamiltonian cycles. In this paper we generalize a result by Kotzig that the Cartesian product of any two cycles can be decomposed into two hamiltonian cycles and show that

On the extremal number of edges in hamil
On the extremal number of edges in hamiltonian connected graphs
โœ Tung-Yang Ho; Cheng-Kuan Lin; Jimmy J.M. Tan; D. Frank Hsu; Lih-Hsing Hsu ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 421 KB

a b s t r a c t Assume that n and ฮด are positive integers with 3 โ‰ค ฮด < n. Let hc(n, ฮด) be the minimum number of edges required to guarantee an n-vertex graph G with minimum degree ฮด(G) โ‰ฅ ฮด to be hamiltonian connected.