Pages that link to "Item:Q5283773"

The following pages link to Proof of the 1-factorization and Hamilton Decomposition Conjectures (Q5283773):

Displaying 24 items.

• Counting and packing Hamilton cycles in dense graphs and oriented graphs (Q345082) (← links)
• Compatible Hamilton cycles in Dirac graphs (Q681601) (← links)
• The number of Hamiltonian decompositions of regular graphs (Q1686305) (← links)
• Decomposing tournaments into paths (Q1690018) (← links)
• Graph edge coloring: a survey (Q1733850) (← links)
• Resolution of the Oberwolfach problem (Q2039583) (← links)
• Decomposing hypergraphs into cycle factors (Q2101168) (← links)
• The chromatic index of graphs with large even order \(n\) and minimum degree at least \(2n/3\) (Q2138974) (← links)
• Chromatic index of dense quasirandom graphs (Q2171027) (← links)
• Number of 1-factorizations of regular high-degree graphs (Q2220965) (← links)
• Minimum degree conditions for monochromatic cycle partitioning (Q2221921) (← links)
• Packing degenerate graphs (Q2324574) (← links)
• A greedy algorithm for the social golfer and the Oberwolfach problem (Q2670589) (← links)
• Path and cycle decompositions of dense graphs (Q3384033) (← links)
• The chromatic index of strongly regular graphs (Q3390046) (← links)
• A blow-up lemma for approximate decompositions (Q4633567) (← links)
• Tree decompositions of graphs without large bipartite holes (Q5120745) (← links)
• Decomposition of 4k-regular graphs into k 4-regular K5-free and (K5 − e)-free subgraphs (Q5862695) (← links)
• Independence number and the normalized Laplacian eigenvalue one (Q6059100) (← links)
• Edge coloring graphs with large minimum degree (Q6094039) (← links)
• Optimal patrolling strategies for trees and complete networks (Q6096604) (← links)
• Maximally edge‐connected realizations and Kundu's k $k$‐factor theorem (Q6142661) (← links)
• Pairwise Disjoint Perfect Matchings in <i>r</i>-Edge-Connected <i>r</i>-Regular Graphs (Q6170446) (← links)
• Graph and hypergraph packing (Q6198635) (← links)