Hamilton cycles in random lifts of graphs

DOI10.1016/j.ejc.2006.05.005zbMath1106.05087OpenAlexW1991070563WikidataQ57401502 ScholiaQ57401502MaRDI QIDQ5898131

Prasad Chebolu, Alan M. Frieze, Colin Cooper, K. Burgin

Publication date: 15 November 2006

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2006.05.005

zbMATH Keywords

random covering

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Eulerian and Hamiltonian graphs (05C45)

Related Items (max. 100)

Expander graphs and their applications ⋮ Random lifts of graphs are highly connected ⋮ On the Number of Perfect Matchings in Random Lifts ⋮ Hamilton cycles in random lifts of graphs ⋮ The chromatic number of random lifts of

Cites Work

• Unnamed Item
• Random graph coverings. I: General theory and graph connectivity
• Limit distribution for the existence of Hamiltonian cycles in random bipartite graphs
• Hamiltonian circuits in random graphs
• On the existence of Hamiltonian cycles in a class of random graphs
• Random lifts of graphs: perfect matchings
• Random lifts of graphs: Independence and chromatic number
• Random Lifts of Graphs: Edge Expansion

This page was built for publication: Hamilton cycles in random lifts of graphs