Pages that link to "Item:Q1170259"

The following pages link to Hamiltonian decomposition of lexicographic product (Q1170259):

Displaying 21 items.

• The Hamilton-Waterloo problem with \(C_4\) and \(C_m\) factors (Q501060) (← links)
• Interval edge-colorings of composition of graphs (Q516842) (← links)
• On optimizing edge connectivity of product graphs (Q626866) (← links)
• Hamilton cycle decompositions of the tensor products of complete bipartite graphs and complete multipartite graphs (Q710567) (← links)
• Directed Hamilton cycle decompositions of the tensor products of symmetric digraphs (Q844233) (← links)
• Hamilton cycle decompositions of the tensor product of complete multipartite graphs (Q932683) (← links)
• Construction of strongly balanced uniform repeated measurements designs (Q1101166) (← links)
• Hamiltonian decomposition of lexicographic products of digraphs (Q1127876) (← links)
• On the Oberwolfach problem for complete multigraphs (Q1367027) (← links)
• Hamiltonian decomposition of complete regular multipartite digraphs (Q1377885) (← links)
• Factorizations of product graphs into cycles of uniform length (Q1805375) (← links)
• The Oberwolfach problem and factors of uniform odd length cycles (Q1825209) (← links)
• The equipartite Oberwolfach problem with uniform tables (Q1865407) (← links)
• Edge exchanges in Hamiltonian decompositions of Kronecker-product graphs (Q1913439) (← links)
• On restricted edge-connectivity of lexicographic product graphs (Q2935381) (← links)
• Orthogonally Resolvable Cycle Decompositions (Q2950653) (← links)
• Factorizations of complete graphs into cycles and 1-factors (Q3303519) (← links)
• (Q4934840) (← links)
• On hamiltonian decompositions of tensor products of graphs (Q5028801) (← links)
• Hamiltonian cycles decomposition of two cycles’s composite (Q5069974) (← links)
• On the minisymposium problem (Q6617235) (← links)