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)
05C38: Paths and cycles
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Unnamed Item, On hamiltonian decompositions of tensor products of graphs, Smallest independent dominating sets in Kronecker products of cycles, A family of efficient six-regular circulants representable as a Kronecker product, Cycle Kronecker products that are representable as optimal circulants, Hamilton cycle decompositions of the tensor products of complete bipartite graphs and complete multipartite graphs, Hamilton cycle decompositions of the tensor product of complete multipartite graphs, Hamilton cycles in tensor product of graphs, Efficient eight-regular circulants based on the Kronecker product, Edge exchanges in Hamiltonian decompositions of Kronecker-product graphs, Matching preclusion for direct product of regular graphs, On total coloring the direct product of cycles and bipartite direct product of graphs