scientific article; zbMATH DE number 1496581

DOI<link itemprop=identifier href="https://doi.org/10.1002/1098-2418(200007)16:4<369::AID-RSA6>3.0.CO;2-J" /><369::AID-RSA6>3.0.CO;2-J 10.1002/1098-2418(200007)16:4<369::AID-RSA6>3.0.CO;2-JzbMath0956.05066MaRDI QIDQ4500692

Colin Cooper, Alan M. Frieze

Publication date: 7 March 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

digraphrandom graphsHamilton cycles

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (11)

Getting a Directed Hamilton Cycle Two Times Faster ⋮ Finding Hamilton cycles in random graphs with few queries ⋮ A scaling limit for the length of the longest cycle in a sparse random digraph ⋮ On the existence of Hamilton cycles with a periodic pattern in a random digraph ⋮ Minimum-weight combinatorial structures under random cost-constraints ⋮ Perfect matchings and Hamiltonian cycles in the preferential attachment model ⋮ On the equational graphs over finite fields ⋮ Rainbow hamilton cycles in random graphs ⋮ Hamilton cycles in the union of random permutations ⋮ Hamilton cycles in 3-out ⋮ Hamiltonian Berge cycles in random hypergraphs

Cites Work

• The limiting probability that \(\alpha\)-in, \(\beta\)-out is strongly connected
• On the connectivity of random m-orientable graphs and digraphs
• Matchings in random regular bipartite digraphs
• Hamilton cycles in a class of random directed graphs
• On tree census and the giant component in sparse random graphs
• The Strongly Connected Components of 1-in, 1-out
• Average Case Analysis of a Heuristic for the Assignment Problem
• The birth of the giant component
• Stable husbands
• Unnamed Item

This page was built for publication: