Pages that link to "Item:Q1686305"

The following pages link to The number of Hamiltonian decompositions of regular graphs (Q1686305):

Displaying 10 items.

• Sparse Hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles (Q1045171) (← links)
• Hamiltonian decomposition of \(K^*_ n\), patterns with distinct differences, and Tuscan squares (Q1182863) (← links)
• Pairwise compatible Hamilton decompositions of \(K_n\) (Q1364230) (← links)
• Hamiltonian cycles above expectation in \(r\)-graphs and quasi-random \(r\)-graphs (Q2072184) (← links)
• Number of 1-factorizations of regular high-degree graphs (Q2220965) (← links)
• Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search (Q2230729) (← links)
• On sparse hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles (Q3439441) (← links)
• Counting Hamilton Decompositions of Oriented Graphs (Q5233804) (← links)
• Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-regular Multigraph (Q5870844) (← links)
• Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming (Q6645186) (← links)