Hamiltonian decomposition of complete regular multipartite digraphs

DOI10.1016/S0012-365X(97)00017-4zbMath0887.05042OpenAlexW2070163566MaRDI QIDQ1377885

Lenhard L. Ng

Publication date: 28 April 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00017-4

zbMATH Keywords

graph decompositionhamiltonian cycle

Mathematics Subject Classification ID

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

Related Items (6)

Directed Hamilton cycle decompositions of the tensor products of symmetric digraphs ⋮ Hamiltonian decomposition of lexicographic products of digraphs ⋮ Unnamed Item ⋮ Packing strong subgraph in digraphs ⋮ Hamilton decompositions of regular expanders: applications ⋮ An approximate version of Jackson’s conjecture

Cites Work

• A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
• Hamiltonian decomposition of lexicographic product
• On decomposition of r-partite graphs into edge-disjoint Hamilton circuits
• Decomposition of the complete directed graph into k-circuits
• Unnamed Item

This page was built for publication: Hamiltonian decomposition of complete regular multipartite digraphs