Pages that link to "Item:Q795057"

The following pages link to Hamiltonian decompositions of complete graphs (Q795057):

Displaying 41 items.

• Embedding an edge-colored \(K(a^{(p)};\lambda,\mu)\) into a Hamiltonian decomposition of \(K(a^{(p+r)};\lambda,\mu)\) (Q354461) (← links)
• Connected Baranyai's theorem (Q397066) (← links)
• On the intricacy of combinatorial construction problems (Q799678) (← links)
• Amalgamations of factorizations of complete graphs (Q885295) (← links)
• Hamilton decompositions of balanced complete multipartite graphs with primitive leaves (Q973125) (← links)
• Hamilton decompositions of graphs with primitive complements (Q1044964) (← links)
• Hamiltonian decompositions of complete regular s-partite graphs (Q1076042) (← links)
• Amalgamations of almost regular edge-colourings of simple graphs (Q1108284) (← links)
• On the number of edge-disjoint one factors and the existence of \(k\)-factors in complete multipartite graphs (Q1126293) (← links)
• Outline symmetric Latin squares (Q1183972) (← links)
• Amalgamations of connected \(k\)-factorizations. (Q1400963) (← links)
• Hamiltonian double Latin squares (Q1403912) (← links)
• Hamilton decompositions of complete graphs with a 3-factor leave. (Q1428535) (← links)
• Fractional latin squares, simplex algebras, and generalized quotients (Q1569869) (← links)
• Constructing day-balanced round-robin tournaments with partitions (Q1682881) (← links)
• Fair and internally fair (holey) Hamiltonian decompositions of \(K(n_0, \ldots, n_{p - 1}; \lambda_1, \lambda_2)\) (Q1685980) (← links)
• Amalgamating infinite Latin squares (Q1773357) (← links)
• \(G\)-designs and related designs (Q1802138) (← links)
• Fair Hamilton decompositions of complete multipartite graphs (Q1850614) (← links)
• Amalgamations of factorizations of complete equipartite graphs (Q1876684) (← links)
• Embedding connected factorizations (Q2131871) (← links)
• On the multicolor size Ramsey number of stars and cliques (Q2185902) (← links)
• Enclosings of decompositions of complete multigraphs in 2-edge-connected \(r\)-factorizations (Q2319700) (← links)
• Fair holey Hamiltonian decompositions of complete multipartite graphs and long cycle frames (Q2339434) (← links)
• Factorizations of complete multipartite hypergraphs (Q2374157) (← links)
• Fair 1-factorizations and fair holey 1-factorizations of complete multipartite graphs (Q2631079) (← links)
• Decomposing Complete Equipartite Multigraphs into Cycles of Variable Lengths: The Amalgamation-detachment Approach (Q2804929) (← links)
• Multiply balanced edge colorings of multigraphs (Q2897208) (← links)
• Detachments of Hypergraphs I: The Berge–Johnson Problem (Q2908122) (← links)
• Almost regular edge colorings and regular decompositions of complete graphs (Q3614746) (← links)
• Amalgamated Factorizations of Complete Graphs (Q4305317) (← links)
• Detachments of Amalgamated 3‐Uniform Hypergraphs Factorization Consequences (Q4906045) (← links)
• Embedding Factorizations for 3-Uniform Hypergraphs (Q4920661) (← links)
• Maximal sets of Hamilton cycles inKn,n (Q4944682) (← links)
• An approximate version of Jackson’s conjecture (Q4993113) (← links)
• (Q5001002) (← links)
• Amalgamations and Equitable Block-Colorings (Q5114854) (← links)
• A note on Hamiltonian decomposition of Bubble-Sort graphs (Q5739598) (← links)
• Decomposition of cartesian product of complete graphs into sunlet graphs of order eight (Q5884129) (← links)
• Rainbow subgraphs in Hamiltonian cycle decompositions of complete graphs (Q6041575) (← links)
• A constructive solution to the Oberwolfach problem with a large cycle (Q6204356) (← links)