scientific article; zbMATH DE number 1496581

DOI10.1002/1098-2418(200007)16:4%3C369::AID-RSA6%3E3.0.CO;2-JzbMATH Open0956.05066MaRDI QIDQ4500692FDOQ4500692

Authors: Colin Cooper, Alan Frieze 

Publication date: 7 March 2001

Title of this publication is not available (Why is that?)

Recommendations

• Hamilton cycles in a class of random directed graphs
• Hamilton Cycles in Random Lifts of Directed Graphs
• Hamiltonian cycles in random regular graphs
• Hamilton cycles in random graphs with a fixed degree sequence
• Hamilton Cycles in Random Regular Digraphs
• scientific article; zbMATH DE number 1047719
• Hamilton cycles in random geometric graphs
• Counting Hamilton cycles in sparse random directed graphs

zbMATH Keywords

digraphrandom graphsHamilton cycles

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (20)

• On the existence of Hamilton cycles with a periodic pattern in a random digraph
• A scaling limit for the length of the longest cycle in a sparse random digraph
• Hamiltonian Berge cycles in random hypergraphs
• Hamilton Cycles in Random Lifts of Directed Graphs
• Title not available (Why is that?)
• Perfect matchings and Hamiltonian cycles in the preferential attachment model
• Getting a directed Hamilton cycle two times faster
• Finding Hamilton cycles in random graphs with few queries
• On two Hamilton cycle problems in random graphs
• Hamilton cycles in the semi-random graph process
• Hamilton cycles in 3-out
• On the equational graphs over finite fields
• Rainbow Hamilton cycles in random graphs
• Hamilton cycles containing randomly selected edges in random regular graphs
• Title not available (Why is that?)
• Minimum-weight combinatorial structures under random cost-constraints
• Hamilton cycles in random lifts of graphs
• Packing, counting and covering Hamilton cycles in random directed graphs
• Interview with Alan Frieze
• Hamilton cycles in the union of random permutations

This page was built for publication:

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