Directed Hamilton cycle decompositions of the tensor products of symmetric digraphs
From MaRDI portal
Publication:844233
DOI10.1007/s00373-009-0866-4zbMath1216.05125OpenAlexW2009737622MaRDI QIDQ844233
Publication date: 18 January 2010
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-009-0866-4
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45) Graph operations (line graphs, products, etc.) (05C76)
Related Items
\(2p\)-cycle decompositions of some regular graphs and digraphs ⋮ On the directed Oberwolfach problem for complete symmetric equipartite digraphs and uniform‐length cycles ⋮ Decomposition of the tensor product of complete graphs into cycles of lengths 3 and 6 ⋮ Digraphs Products ⋮ On hamiltonian decompositions of tensor products of graphs
Cites Work
- 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
- Hamiltonian decomposition of lexicographic products of digraphs
- A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
- Hamiltonian decomposition of lexicographic product
- Hamiltonian decomposition of complete regular multipartite digraphs
- On Hamilton cycle decompositions of the tensor product of complete graphs
- Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles
- Hamilton cycles in tensor product of graphs
- Hamilton decompositions of directed cubes and products
- A textbook of graph theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Directed Hamilton cycle decompositions of the tensor products of symmetric digraphs