On Hamilton-cycles of random graphs

DOI10.1007/BF02029168MaRDI QIDQ2549331zbMATH OpenOpenAlexWikidataFDO

Authors Ilona Palásti

Publication date 1971

Published in Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02029168

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Cites work

• scientific article; zbMATH DE number 3127542 (Why is no real title available?)
• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 3375520 (Why is no real title available?)
• On the existence of a factor of degree one of a connected random graph
• On the strength of connectedness of a random graph

Cited in

(3)

• Graph theory
• Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations
• On the number of certain Hamilton circuits of a complete graph

This page was built for publication: On Hamilton-cycles of random graphs

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