搜索历史记录选项已关闭,请开启搜索历史记录选项。
作者: Marc Noy , Omer Gimenez
DOI:
关键词:
摘要: We show an asymptotic estimate for the number of labelled planar graphs on $n$ vertices. also find limit laws edges, connected components, and other parameters in random graphs.
Discrete Mathematics & Theoretical Computer Science,2007, 引用: 5
Discrete Mathematics & Theoretical Computer Science,2009, 引用: 3
,2009, 引用: 1
Thirty Essays on Geometric Graph Theory,2013, 引用: 14
Electronic Journal of Combinatorics,2008, 引用: 14
international workshop and international workshop on approximation randomization and combinatorial optimization algorithms and techniques,2008, 引用: 16
arXiv: Combinatorics,2006, 引用: 0
symposium on discrete algorithms,2009, 引用: 7
Journal of Combinatorial Theory, Series A,2011, 引用: 29
symposium on discrete algorithms,2007, 引用: 2