Generating and Counting Hamilton Cycles in Random Regular Graphs
From MaRDI portal
Recommendations
- Hamiltonian cycles in random regular graphs
- On the number of hamilton cycles in a random graph
- Counting the Number of Hamilton Cycles in Random Digraphs
- Hamilton Cycles in Random Regular Digraphs
- scientific article; zbMATH DE number 1047719
- Hamilton cycles containing randomly selected edges in random regular graphs
- Hamilton cycles in random graphs with a fixed degree sequence
- On the number of Hamilton cycles in pseudo-random graphs
Cited in
(33)- Hamiltonian cycles in random regular graphs
- Hamiltonian decompositions of random bipartite regular graphs.
- Random matchings which induce Hamilton cycles and Hamiltonian decompositions of random regular graphs
- A threshold result for loose Hamiltonicity in random regular uniform hypergraphs
- Hamilton cycles containing randomly selected edges in random regular graphs
- On the number of circuits in random graphs
- Cycle factors and renewal theory
- Estimation of the number of Hamiltonian cycles in regular graphs of special type
- The asymptotic distribution of the number of 3-star factors in random d-regular graphs
- scientific article; zbMATH DE number 1003265 (Why is no real title available?)
- Random Regular Graphs of Non-Constant Degree: Connectivity and Hamiltonicity
- An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three
- Generating 4-regular Hamiltonian plane graphs
- The number of Euler tours of random directed graphs
- scientific article; zbMATH DE number 17675 (Why is no real title available?)
- Counting the Number of Hamilton Cycles in Random Digraphs
- scientific article; zbMATH DE number 4123549 (Why is no real title available?)
- Approximately Counting Hamilton Paths and Cycles in Dense Graphs
- On the minimum number of Hamiltonian cycles in regular graphs
- Hamilton cycles in the union of random permutations
- The dominating number of a random cubic graph
- A polynomial-time algorithm to determine (almost) Hamiltonicity of dense regular graphs
- Satisfiability thresholds for regular occupation problems
- On the number of Hamilton cycles in bounded degree graphs
- Enumerating all Hamilton cycles and bounding the number of Hamilton cycles in 3-regular graphs
- Approximately counting embeddings into random graphs
- Heavy and light paths and Hamilton cycles
- An improved fully polynomial randomized approximation scheme (FPRAS) for counting the number of Hamiltonian cycles in dense digraphs
- Satisfiability thresholds for regular occupation problems
- Consecutive ones property and PQ-trees for multisets: hardness of counting their orderings
- An \(\mathcal{O}(N)\) time algorithm for finding Hamilton cycles with high probability
- Hamiltonian cycles in subdivided doubles
- 3-star factors in random d-regular graphs
This page was built for publication: Generating and Counting Hamilton Cycles in Random Regular Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4895803)
