Pages that link to "Item:Q1876671"

The following pages link to Cycle systems in the complete bipartite graph minus a one-factor (Q1876671):

Displaying 13 items.

• Large sets of Hamilton cycle decompositions of complete bipartite graphs (Q932831) (← links)
• Decomposing the complete graph and the complete graph minus a 1-factor into copies of a graph \(G\) where \(G\) is the union of two disjoint cycles (Q1678094) (← links)
• Decomposing various graphs into short even-length cycles (Q1928579) (← links)
• Six-cycle systems (Q2054649) (← links)
• \( \mathcal{P} \)-energy of graphs (Q2220240) (← links)
• Monochromatic \(k\)-edge-connection colorings of graphs (Q2280002) (← links)
• Decomposition of complete bipartite graphs into cycles of distinct even lengths (Q2631082) (← links)
• A greedy algorithm for the social golfer and the Oberwolfach problem (Q2670589) (← links)
• Decomposing complete equipartite multigraphs into cycles of variable lengths: the amalgamation-detachment approach (Q2804929) (← links)
• On Complete (<i>s,t</i>)-Cycle Systems of Complete Graphs (Q2831827) (← links)
• Symmetric Hamilton cycle decompositions of complete graphs minus a 1-factor (Q3072529) (← links)
• Packings and Coverings of the Complete Bipartite Graph by Octagons (Q5069682) (← links)
• (Q5435216) (← links)