2 citations · 3 across the 2 of their papers we have counts for
3 papers
math.PR2020
Clustering in a hyperbolic model of complex networks
Nikolaos Fountoulakis, Pim van der Hoorn, Tobias Müller +1
In this paper we consider the clustering coefficient and clustering function in a random graph model proposed by Krioukov et al.~in 2010. In this model, nodes are chosen randomly i…
cs.DM2009★ 2 cited
Acyclic Edge coloring of Planar Graphs
Manu Basavaraju, L. Sunil Chandran
An edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The \emph{acyclic chromatic index} of a graph is the minimum number k suc…
math.CO2009★ 1 cited
Disjoint Hamilton cycles in the random geometric graph
Xavier Pérez-Giménez, Nicholas C. Wormald
We prove a conjecture of Penrose about the standard random geometric graph process, in which n vertices are placed at random on the unit square and edges are sequentially added in…