On the existence of Hamiltonian cycles in a class of random graphs
From MaRDI portal
Publication:1838982
DOI10.1016/0012-365X(83)90046-8zbMATH Open0511.05053DBLPjournals/dm/FennerF83WikidataQ57401639 ScholiaQ57401639MaRDI QIDQ1838982FDOQ1838982
Authors: T. I. Fenner, Alan Frieze 
Publication date: 1983
Published in: Discrete Mathematics (Search for Journal in Brave)
Directed graphs (digraphs), tournaments (05C20) Random graphs (graph-theoretic aspects) (05C80) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- Hamiltonian circuits in random graphs
- Limit distribution for the existence of Hamiltonian cycles in a random graph
- General percolation and random graphs
- Almost all regular graphs are Hamiltonian
- Matchings in random regular bipartite digraphs
- On the connectivity of random m-orientable graphs and digraphs
- Hamiltonian cycles in random regular graphs
Cited In (22)
- Maximum matchings in a class of random graphs
- Matchings and cycle covers in random digraphs
- On large matchings and cycles in sparse random graphs
- Partitioning random graphs into large cycles
- On the largest strong components in \(m\)-out digraphs
- Perfect matchings and Hamiltonian cycles in the preferential attachment model
- On two Hamilton cycle problems in random graphs
- Hamilton cycles in 3-out
- Graph theory (algorithmic, algebraic, and metric problems)
- Long paths in sparse random graphs
- Almost all regular graphs are Hamiltonian
- Random near-regular graphs and the node packing problem
- A scaling limit for the length of the longest cycle in a sparse random graph
- Hamilton cycles in random lifts of graphs
- Quantized consensus in Hamiltonian graphs
- An algorithm for finding Hamilton paths and cycles in random graphs
- How many random edges make a graph Hamiltonian?
- Interview with Alan Frieze
- On the connectivity of random m-orientable graphs and digraphs
- Connectivity threshold of Bluetooth graphs
- Finding Hamilton cycles in sparse random graphs
- Hamiltonian cycles in random regular graphs
This page was built for publication: On the existence of Hamiltonian cycles in a class of random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1838982)
