Hamiltonian decompositions of products of cycles
From MaRDI portal
Publication:5905596
zbMath0783.05080MaRDI QIDQ5905596
No author found.
Publication date: 17 January 1993
Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (12)
Edge exchanges in Hamiltonian decompositions of Kronecker-product graphs ⋮ Unnamed Item ⋮ On total coloring the direct product of cycles and bipartite direct product of graphs ⋮ Hamilton cycle decompositions of the tensor product of complete multipartite graphs ⋮ Cycle Kronecker products that are representable as optimal circulants ⋮ Efficient eight-regular circulants based on the Kronecker product ⋮ Hamilton cycle decompositions of the tensor products of complete bipartite graphs and complete multipartite graphs ⋮ Smallest independent dominating sets in Kronecker products of cycles ⋮ Matching preclusion for direct product of regular graphs ⋮ Hamilton cycles in tensor product of graphs ⋮ On hamiltonian decompositions of tensor products of graphs ⋮ A family of efficient six-regular circulants representable as a Kronecker product
This page was built for publication: Hamiltonian decompositions of products of cycles
