Edge exchanges in Hamiltonian decompositions of Kronecker-product graphs

DOI10.1016/0898-1221(95)00189-1zbMath0849.05057OpenAlexW1999140149MaRDI QIDQ1913439

Rajesh Kumar, Naveen Agnihotri, Pranava K. Jha

Publication date: 8 July 1996

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(95)00189-1

zbMATH Keywords

Hamiltonian cycleKronecker-product graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items

Vertex vulnerability parameters of Kronecker products of complete graphs ⋮ A dual of 4-regular graph forG × C_2n ⋮ On hamiltonian decompositions of tensor products of graphs

Cites Work

• Hamiltonian decomposition of Cayley graphs of degree 4
• Hamiltonian decomposition of lexicographic product
• NP-completeness of graph decomposition problems
• Decompositions of the Kronecker product of a cycle and a path into long cycles and long paths
• Parallel concepts in graph theory
• The Kronecker Product of Graphs
• Kronecker Products and Local Joins of Graphs
• Hamiltonian Decompositions of Graphs, Directed Graphs and Hypergraphs
• The Categorical Product of Graphs
• On Characterizing Tensor Composite Graphs
• Hamiltonian decompositions of products of cycles
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item