Hamiltonian cycles in random regular graphs

DOI10.1016/0095-8956(84)90066-2zbMATH Open0574.05034DBLPjournals/jct/FennerF84OpenAlexW1976286395WikidataQ57401634 ScholiaQ57401634MaRDI QIDQ1063002FDOQ1063002

Authors: T. I. Fenner, Alan 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

Recommendations

• Almost all regular graphs are hamiltonian
• Generating and Counting Hamilton Cycles in Random Regular Graphs
• Finding Hamilton cycles in sparse random graphs
• Random Regular Graphs of Non-Constant Degree: Connectivity and Hamiltonicity
• Almost all cubic graphs are Hamiltonian

zbMATH Keywords

Hamilton cycleregular random graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Title not available (Why is that?)
• Hamiltonian circuits in random graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Limit distribution for the existence of Hamiltonian cycles in a random graph
• General percolation and random graphs
• The number of matchings in random regular graphs and bipartite graphs
• On the existence of Hamiltonian cycles in a class of random graphs

Cited In (37)

• Title not available (Why is that?)
• Partitioning random graphs into large cycles
• On the number of hamilton cycles in a random graph
• Dirac's theorem for random regular graphs
• Hamiltonian cycles on a random three-coordinate lattice
• On two Hamilton cycle problems in random graphs
• Random Regular Graphs of Non-Constant Degree: Connectivity and Hamiltonicity
• Hamilton cycles in the semi-random graph process
• Title not available (Why is that?)
• Hamilton Cycles in Random Regular Digraphs
• Almost all regular graphs are hamiltonian
• The threshold for hamilton cycles in the square of a random graph
• High powers of Hamiltonian cycles in randomly augmented graphs
• Title not available (Why is that?)
• On extension of regular graphs
• Hamilton cycles containing randomly selected edges in random regular graphs
• Title not available (Why is that?)
• Random near-regular graphs and the node packing problem
• On the existence of Hamiltonian cycles in a class of random graphs
• On the Number of Hamilton Cycles in Sparse Random Graphs
• A scaling limit for the length of the longest cycle in a sparse random graph
• Hamilton cycles in random lifts of graphs
• Title not available (Why is that?)
• On the Hamiltonicity of random bipartite graphs
• Title not available (Why is that?)
• Rainbow Hamilton cycles in random regular graphs
• Asymptotic enumeration by degree sequence of graphs of high degree
• Title not available (Why is that?)
• Perfect fractional matchings in \(k\)-out hypergraphs
• Limit distribution for the existence of Hamiltonian cycles in a random graph
• Local resilience and hamiltonicity maker-breaker games in random regular graphs
• Sparse pseudo‐random graphs are Hamiltonian
• Generating and Counting Hamilton Cycles in Random Regular Graphs
• On the Hamiltonicity of the \(k\)-regular graph game
• Finding Hamilton cycles in sparse random graphs
• Hamilton cycles in the union of random permutations
• A note on long cycles in sparse random graphs

This page was built for publication: Hamiltonian cycles in random regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1063002)