Random Planar Maps and Graphs with Minimum Degree Two and Three

Electronic Journal Of Combinatorics

Marc Noy¹ 

关键词: Asymptotic enumeration;    Planar graphs;    Random graphs;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

We find precise asymptotic estimates for the number of planar maps and graphs with a condition on the minimum degree, and properties of random graphs from these classes. In particular we show that the size of the largest tree attached to the core of a ran

【 授权许可】

Others