Hamiltonian decomposition of lexicographic product
From MaRDI portal
Publication:1170259
DOI10.1016/0095-8956(81)90028-9zbMath0496.05036OpenAlexW2062765085MaRDI QIDQ1170259
Publication date: 1981
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(81)90028-9
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99) Eulerian and Hamiltonian graphs (05C45)
Related Items (20)
Unnamed Item ⋮ Directed Hamilton cycle decompositions of the tensor products of symmetric digraphs ⋮ Construction of strongly balanced uniform repeated measurements designs ⋮ Hamiltonian cycles decomposition of two cycles’s composite ⋮ On the Oberwolfach problem for complete multigraphs ⋮ Edge exchanges in Hamiltonian decompositions of Kronecker-product graphs ⋮ On restricted edge-connectivity of lexicographic product graphs ⋮ Hamiltonian decomposition of complete regular multipartite digraphs ⋮ Hamiltonian decomposition of lexicographic products of digraphs ⋮ Orthogonally Resolvable Cycle Decompositions ⋮ On optimizing edge connectivity of product graphs ⋮ Hamilton cycle decompositions of the tensor product of complete multipartite graphs ⋮ The Hamilton-Waterloo problem with \(C_4\) and \(C_m\) factors ⋮ Interval edge-colorings of composition of graphs ⋮ Hamilton cycle decompositions of the tensor products of complete bipartite graphs and complete multipartite graphs ⋮ Factorizations of product graphs into cycles of uniform length ⋮ The Oberwolfach problem and factors of uniform odd length cycles ⋮ Factorizations of complete graphs into cycles and 1-factors ⋮ The equipartite Oberwolfach problem with uniform tables ⋮ On hamiltonian decompositions of tensor products of graphs
Cites Work
This page was built for publication: Hamiltonian decomposition of lexicographic product
