Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Giménez, Omer
and
Noy, Marc
2004.
Mathematics and Computer Science III.
p.
133.
McDiarmid, Colin
Steger, Angelika
and
Welsh, Dominic J.A.
2005.
Random planar graphs.
Journal of Combinatorial Theory, Series B,
Vol. 93,
Issue. 2,
p.
187.
Bodirsky, Manuel
Gröpl, Clemens
and
Kang, Mihyun
2005.
Algorithms and Computation.
Vol. 3827,
Issue. ,
p.
593.
Bodirsky, Manuel
Giménez, Omer
Kang, Mihyun
and
Noy, Marc
2007.
Enumeration and limit laws for series–parallel graphs.
European Journal of Combinatorics,
Vol. 28,
Issue. 8,
p.
2091.
Bodirsky, Manuel
Kang, Mihyun
Löffler, Mike
and
McDiarmid, Colin
2007.
Random cubic planar graphs.
Random Structures & Algorithms,
Vol. 30,
Issue. 1-2,
p.
78.
Bodirsky, Manuel
Gröpl, Clemens
and
Kang, Mihyun
2007.
Generating labeled planar graphs uniformly at random.
Theoretical Computer Science,
Vol. 379,
Issue. 3,
p.
377.
McDiarmid, Colin
2008.
Random graphs on surfaces.
Journal of Combinatorial Theory, Series B,
Vol. 98,
Issue. 4,
p.
778.
Barthélemy, Marc
and
Flammini, Alessandro
2008.
Modeling Urban Street Patterns.
Physical Review Letters,
Vol. 100,
Issue. 13,
Giménez, Omer
and
Noy, Marc
2008.
Asymptotic enumeration and limit laws of planar graphs.
Journal of the American Mathematical Society,
Vol. 22,
Issue. 2,
p.
309.
Gerke, Stefanie
Schlatter, Dirk
Steger, Angelika
and
Taraz, Anusch
2008.
The random planar graph process.
Random Structures & Algorithms,
Vol. 32,
Issue. 2,
p.
236.
Bodirsky, Manuel
Gröpl, Clemens
and
Kang, Mihyun
2008.
Generating unlabeled connected cubic planar graphs uniformly at random.
Random Structures & Algorithms,
Vol. 32,
Issue. 2,
p.
157.
Drmota, Michael
2009.
Research Trends in Geographic Information Science.
p.
189.
Drmota, Michael
and
Gittenberger, Bernhard
2009.
Analysis of Complex Networks.
p.
425.
Barthélemy, Marc
and
Flammini, Alessandro
2009.
Co-evolution of Density and Topology in a Simple Model of City Formation.
Networks and Spatial Economics,
Vol. 9,
Issue. 3,
p.
401.
Masucci, A. P.
Smith, D.
Crooks, A.
and
Batty, M.
2009.
Random planar graphs and the London street network.
The European Physical Journal B,
Vol. 71,
Issue. 2,
p.
259.
Balogh, József
and
Samotij, Wojciech
2010.
Almost All $C_4$-Free Graphs Have Fewer than $(1-\varepsilon)\,\mathrm{ex}(n,C_4)$ Edges.
SIAM Journal on Discrete Mathematics,
Vol. 24,
Issue. 3,
p.
1011.
Drmota, Michael
Giménez, Omer
and
Noy, Marc
2011.
Degree distribution in random planar graphs.
Journal of Combinatorial Theory, Series A,
Vol. 118,
Issue. 7,
p.
2102.
Bonichon, Nicolas
Gavoille, Cyril
and
Hanusse, Nicolas
2011.
Towards an Information Theory of Complex Networks.
p.
17.
Dowden, Chris
Kang, Mihyun
and
Sprüssel, Philipp
2018.
The Evolution of Random Graphs on Surfaces.
SIAM Journal on Discrete Mathematics,
Vol. 32,
Issue. 1,
p.
695.
Chauhan, Varsha
Gutfraind, Alexander
and
Safro, Ilya
2019.
Multiscale planar graph generation.
Applied Network Science,
Vol. 4,
Issue. 1,