On the existence of Hamiltonian cycles in a class of random graphs
From MaRDI portal
Publication:1838982
DOI10.1016/0012-365X(83)90046-8zbMath0511.05053WikidataQ57401639 ScholiaQ57401639MaRDI QIDQ1838982
Trevor I. Fenner, Alan M. Frieze
Publication date: 1983
Published in: Discrete Mathematics (Search for Journal in Brave)
Random graphs (graph-theoretic aspects) (05C80) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)
Related Items
Finding Hamilton cycles in sparse random graphs, On large matchings and cycles in sparse random graphs, Maximum matchings in a class of random graphs, An algorithm for finding Hamilton paths and cycles in random graphs, Partitioning random graphs into large cycles, Long paths in sparse random graphs, Quantized consensus in Hamiltonian graphs, Perfect matchings and Hamiltonian cycles in the preferential attachment model, Matchings and cycle covers in random digraphs, On the largest strong components in \(m\)-out digraphs, On two Hamilton cycle problems in random graphs, Hamilton cycles in random lifts of graphs, A scaling limit for the length of the longest cycle in a sparse random graph, Hamilton cycles in 3-out, Graph theory (algorithmic, algebraic, and metric problems), Almost all regular graphs are Hamiltonian, How many random edges make a graph Hamiltonian?, On the connectivity of random m-orientable graphs and digraphs, Hamiltonian cycles in random regular graphs, Random near-regular graphs and the node packing problem, Connectivity threshold of Bluetooth graphs
Cites Work
- Almost all regular graphs are Hamiltonian
- Limit distribution for the existence of Hamiltonian cycles in a random graph
- On the connectivity of random m-orientable graphs and digraphs
- Hamiltonian cycles in random regular graphs
- Matchings in random regular bipartite digraphs
- Hamiltonian circuits in random graphs
- General percolation and random graphs
