8 citations · 12 across the 4 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2013★ 8 cited
On the Longest Paths and the Diameter in Random Apollonian Networks
Ehsan Ebrahimzadeh, Linda Farczadi, Pu Gao +4
We consider the following iterative construction of a random planar triangulation. Start with a triangle embedded in the plane. In each step, choose a bounded face uniformly at ran…
math.CO2012
On the Maximum Density of Graphs with Good Edge-Labellings
Abbas Mehrabian, Dieter Mitsche, Paweł Prałat
A good edge-labelling of a simple, finite graph is a labelling of its edges with real numbers such that, for every ordered pair of vertices (u,v), there is at most one nondecreasin…