Hamilton cycles containing randomly selected edges in random regular graphs

DOI10.1002/RSA.1024MaRDI QIDQ2748422zbMATH OpenOpenAlexFDO

Authors R. W. Robinson, Nicholas Wormald

Publication date 25 February 2002

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/rsa.1024

zbMATH Keywords

Hamilton cyclesrandom regular graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• Hamiltonian cycles in random regular graphs
• Hamilton Cycles in Random Regular Digraphs
• scientific article; zbMATH DE number 1047719
• Edge-disjoint Hamilton cycles in random graphs
• Hamilton cycles in random graphs with a fixed degree sequence
• scientific article; zbMATH DE number 1496581
• Hamilton cycles in a class of random directed graphs

Cites work

• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Almost all cubic graphs are Hamiltonian
• Almost all regular graphs are hamiltonian
• Automorphisms of random graphs with specified vertices
• Generating and Counting Hamilton Cycles in Random Regular Graphs
• scientific article; zbMATH DE number 1033851 (Why is no real title available?)
• Random Regular Graphs: Asymptotic Distributions and Contiguity
• The asymptotic number of labeled graphs with given degree sequences
• The Asymptotic Number of Unlabelled Regular Graphs
• The number of matchings in random regular graphs and bipartite graphs

Cited in

(12)

• The asymptotic number of claw-free cubic graphs.
• Cycle factors and renewal theory
• Random Regular Graphs of Non-Constant Degree: Connectivity and Hamiltonicity
• Elegantly colored paths and cycles in edge colored random graphs
• scientific article; zbMATH DE number 3902693 (Why is no real title available?)
• Almost all cubic graphs are Hamiltonian
• Almost all regular graphs are hamiltonian
• scientific article; zbMATH DE number 1047719 (Why is no real title available?)
• Random Regular Graphs: Asymptotic Distributions and Contiguity
• Generating and Counting Hamilton Cycles in Random Regular Graphs
• Hamilton cycles in random graphs with a fixed degree sequence
• Cycle lengths in sparse random graphs

This page was built for publication: Hamilton cycles containing randomly selected edges in random regular graphs

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