On Hamiltonicity of uniform random intersection graphs

MaRDI QIDQ2810028zbMATH OpenFDO

Authors Irmantas Radavičius, Mindaugas Bloznelis

Publication date 30 May 2016

Published in Lietuvos Matematikos Rinkinys. Lietuvos Matematiku Draugijos Darbai (Search for Journal in Brave)

zbMATH Keywords

clusteringrandom graphHamilton cycleintersection graph

Mathematics Subject Classification ID

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

Recommendations

• A note on hamiltonicity of uniform random intersection graphs
• On the independence number and Hamiltonicity of uniform random intersection graphs
• Automata, Languages and Programming
• Sharp thresholds for Hamiltonicity in random intersection graphs
• On the Hamiltonicity of random bipartite graphs
• Hamiltonicity in randomly perturbed hypergraphs
• Finding Hamilton cycles in random intersection graphs
• Hamiltonicity of graphs perturbed by a random geometric graph
• Hamiltonicity of graphs perturbed by a random regular graph
• Publication:4729826

Cited in

(7)

• Automata, Languages and Programming
• Random subcube intersection graphs. I: Cliques and covering
• Algorithms and Computation
• On the independence number and Hamiltonicity of uniform random intersection graphs
• On the Hamiltonicity of random bipartite graphs
• A note on hamiltonicity of uniform random intersection graphs
• Sharp thresholds for Hamiltonicity in random intersection graphs

This page was built for publication: On Hamiltonicity of uniform random intersection graphs

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