Edge exchanges in Hamiltonian decompositions of Kronecker-product graphs (Q1913439): Difference between revisions
From MaRDI portal
Latest revision as of 12:10, 24 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Edge exchanges in Hamiltonian decompositions of Kronecker-product graphs |
scientific article |
Statements
Edge exchanges in Hamiltonian decompositions of Kronecker-product graphs (English)
0 references
8 July 1996
0 references
Sometimes a Hamiltonian cycle can be constructed by combining small edge-disjoint cycles. In this paper, the authors find some sufficient conditions for Kronecker-product graphs to have a Hamiltonian cycle constructed in such a way.
0 references
Hamiltonian cycle
0 references
Kronecker-product graphs
0 references
0 references
