Automata, Languages and Programming
From MaRDI portal
Publication:5716819
DOI10.1007/11523468zbMath1084.05063OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716819
Charilaos Efthymiou, Paul G. Spirakis
Publication date: 10 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11523468
Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45)
Related Items
Random subcube intersection graphs. I: Cliques and covering ⋮ Colouring Non-sparse Random Intersection Graphs ⋮ The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ A note on hamiltonicity of uniform random intersection graphs ⋮ On the independence number and Hamiltonicity of uniform random intersection graphs ⋮ Sharp thresholds for Hamiltonicity in random intersection graphs ⋮ Diameter, connectivity, and phase transition of the uniform random intersection graph ⋮ Selected Combinatorial Properties of Random Intersection Graphs ⋮ Expander properties and the cover time of random intersection graphs