Hamilton Cycles in Random Lifts of Directed Graphs

DOI10.1137/060670808MaRDI QIDQ3629460zbMATH OpenOpenAlexWikidataFDO

Authors Prasad Chebolu, Alan Frieze

Publication date 27 May 2009

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/060670808

zbMATH Keywords

digraphHamilton cycleliftsrandom

Mathematics Subject Classification ID

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

Recommendations

• Hamilton cycles in random lifts of graphs
• Hamilton cycles in random lifts of graphs
• Hamilton cycles in a class of random directed graphs
• Packing and counting arbitrary Hamilton cycles in random digraphs
• scientific article; zbMATH DE number 1496581

Cited in

(6)

• Random lifts of graphs are highly connected
• The matching process and independent process in random regular graphs and hypergraphs
• scientific article; zbMATH DE number 1496581 (Why is no real title available?)
• On the number of perfect matchings in random lifts
• Hamilton cycles in random lifts of graphs
• Hamilton cycles in random lifts of graphs

This page was built for publication: Hamilton Cycles in Random Lifts of Directed Graphs

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