Hamiltonian cycles in random regular graphs
From MaRDI portal
Publication:1063002
DOI10.1016/0095-8956(84)90066-2zbMath0574.05034OpenAlexW1976286395WikidataQ57401634 ScholiaQ57401634MaRDI QIDQ1063002
Trevor I. Fenner, Alan M. Frieze
Publication date: 1984
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(84)90066-2
Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Eulerian and Hamiltonian graphs (05C45)
Related Items
On extension of regular graphs, Finding Hamilton cycles in sparse random graphs, On the Hamiltonicity of random bipartite graphs, Partitioning random graphs into large cycles, Almost all regular graphs are hamiltonian, Hamilton Cycles in Random Regular Digraphs, Perfect fractional matchings in \(k\)-out hypergraphs, A note on long cycles in sparse random graphs, On the Hamiltonicity of the \(k\)-regular graph game, A scaling limit for the length of the longest cycle in a sparse random graph, Hamilton cycles in the union of random permutations, Local Resilience and Hamiltonicity Maker–Breaker Games in Random Regular Graphs, Asymptotic enumeration by degree sequence of graphs of high degree, On the existence of Hamiltonian cycles in a class of random graphs, Random near-regular graphs and the node packing problem
Cites Work
- Limit distribution for the existence of Hamiltonian cycles in a random graph
- The number of matchings in random regular graphs and bipartite graphs
- Hamiltonian circuits in random graphs
- On the existence of Hamiltonian cycles in a class of random graphs
- General percolation and random graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
