Regular colored graphs are dual representations of pure colored D-dimensional complexes.
These graphs can be classi ed with respect to a positive integer, their degree, much like …

We present a unified general method for the asymptotic study of graphs from the so-called
subcritical graph classes, which include the classes of cacti graphs, outerplanar graphs, and …

It is shown that the number of labelled graphs with n vertices that can be embedded in the
orientable surface Sg of genus g grows asymptotically like where c (g)> 0, and γ≈ 27.23 is …

Consider a family article mathrsfs, amsmath, amssymb empty T of 3‐connected graphs of
moderate growth, and let article mathrsfs, amsmath, amssymb empty G be the class of …

This paper proposes a new polynomial time constant factor approximation algorithm for a
more-a-decade-long open NP-hard problem, the minimum four-connected m-dominating set …

We survey several results on the enumeration of planar graphs and on properties of random
planar graphs. This includes basic parameters, such as the number of edges and the …

We provide precise asymptotic estimates for the number of several classes of labeled cubic
planar graphs, and we analyze properties of such random graphs under the uniform …

Over years, virtual backbone has attracted lots of attention as a promising approach to deal
with the broadcasting storm problem in wireless networks. Frequently, the problem of a …

Local convergence of random planar graphs Page 1 © 2021 European Mathematical Society
Published by EMS Press and licensed under a CC BY 4.0 license J. Eur. Math. Soc. 25, 1–73 …

We compute, for each genus g≥ 0, the generating function L g≡ L g (t; p 1, p 2,...) of
(labelled) bipartite maps on the orientable surface of genus g, with control on all face …