Random matchings which induce Hamilton cycles and Hamiltonian decompositions of random regular graphs
From MaRDI portal
Publication:1850508
DOI10.1006/jctb.2000.1991zbMath1030.05107OpenAlexW2053929306MaRDI QIDQ1850508
Nicholas C. Wormald, Jeong Han Kim
Publication date: 10 December 2002
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/cce5f54af5c5d63d5445a6de855e6518b3120bf3
Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Related Items
Packing tight Hamilton cycles in 3-uniform hypergraphs, Proof of the 1-factorization and Hamilton Decomposition Conjectures, The number of Hamiltonian decompositions of regular graphs, Hamilton decompositions of regular expanders: applications, Even cycle decompositions of 4-regular graphs and line graphs, Permutations resilient to deletions, Hamiltonian decompositions of random bipartite regular graphs., Cleaning random \(d\)-regular graphs with brooms, The maximum fuzzy weighted matching models and hybrid genetic algorithm, On packing Hamilton cycles in \(\varepsilon\)-regular graphs, Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm, Local Resilience and Hamiltonicity Maker–Breaker Games in Random Regular Graphs, Approximate Hamilton decompositions of random graphs, Edge-disjoint Hamilton cycles in random graphs, Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-regular Multigraph
Cites Work
- Almost all cubic graphs are Hamiltonian
- Almost all regular graphs are hamiltonian
- Generating Random Regular Graphs Quickly
- Random Regular Graphs: Asymptotic Distributions and Contiguity
- Generating and Counting Hamilton Cycles in Random Regular Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
