Hamiltonian decomposition of lexicographic products of digraphs

DOI10.1006/JCTB.1998.1816zbMath0904.05072OpenAlexW2034445352MaRDI QIDQ1127876

Lenhard L. Ng

Publication date: 10 September 1998

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1998.1816

zbMATH Keywords

lexicographic producthamiltonian decomposition

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 (8)

Directed Hamilton cycle decompositions of the tensor products of symmetric digraphs ⋮ Packing strong subgraph in digraphs ⋮ Completing the solution of the directed Oberwolfach problem with cycles of equal length ⋮ 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 ⋮ Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs ⋮ Digraphs Products ⋮ On hamiltonian decompositions of tensor products of graphs

Cites Work

• Unnamed Item
• A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
• Hamiltonian decomposition of lexicographic product
• Decomposition of the complete directed graph into k-circuits
• Hamiltonian decomposition of complete regular multipartite digraphs

This page was built for publication: Hamiltonian decomposition of lexicographic products of digraphs