Hamilton cycles in tensor product of graphs
From MaRDI portal
Publication:1584279
DOI10.1016/S0012-365X(97)00215-XzbMath0957.05069MaRDI QIDQ1584279
Publication date: 2 November 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Eulerian and Hamiltonian graphs (05C45)
Related Items
Directed Hamilton cycle decompositions of the tensor products of symmetric digraphs ⋮ Hamilton cycle decompositions of the tensor product of complete multipartite graphs ⋮ Hamilton cycle decompositions of the tensor products of complete bipartite graphs and complete multipartite graphs ⋮ On hamiltonian decompositions of tensor products of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Eulerian graphs and related topics. Part 1, Volume 1
- Decompositions of the Kronecker product of a cycle and a path into long cycles and long paths
- Aneulerian digraphs and the determination of those Eulerian digraphs having an odd number of directed Eulerian paths
- Hamiltonian decompositions of products of cycles