Add to ORKGA map is outerplanar if all its vertices lie in the outer face. We enumerate various classes of rooted outerplanar maps with respect to the number of edges and vertices. The proofs involve several bijections with lattice paths. As a consequence of our results, we obtain an e cient scheme for encoding simple outerplanar maps.Peer ReviewedPostprint (published version
B$_0$-VPG graphs are intersection graphs of axis-parallel line segments in the plane. In this paper,...
International audienceThis paper is concerned with the counting and random sampling of plane graphs ...
summary:In this Note, we study infinite graphs with locally finite outerplane embeddings, given a ch...
A map is outerplanar if all its vertices lie in the outer face. We enumerate various classes of root...
AbstractLet G be a planar graph and W a set of vertices, G is W-outerplanar if it can be embedded in...
AbstractAnouterplanargraph is one that can be embedded in the plane so that all of the vertices lie ...
AbstractWe show an algorithm for constructing O(dnlogn) area outerplanar straight-line drawings of n...
AbstractIn this paper, we have studied seven colorings of outerplanar graphs. Two main conclusions h...
AbstractLet G be a planar graph and W a set of vertices, G is W-outerplanar if it can be embedded in...
An outerplanar (also called circular, convex, one-page) drawing of an n-vertex graph G is a drawing ...
AbstractThe paper presents several characterizations of outerplanar graphs, some of them are counter...
AbstractAnouterplanargraph is one that can be embedded in the plane so that all of the vertices lie ...
Let $H$ be a graph. The generalized outerplanar Tur\'an number of $H$, denoted by $f_{\mathcal{OP}}(...
AbstractUlam's conjecture is that a graph G with at least three vertices can be reconstructed from t...
summary:In this Note, we study infinite graphs with locally finite outerplane embeddings, given a ch...
B$_0$-VPG graphs are intersection graphs of axis-parallel line segments in the plane. In this paper,...
International audienceThis paper is concerned with the counting and random sampling of plane graphs ...
summary:In this Note, we study infinite graphs with locally finite outerplane embeddings, given a ch...
A map is outerplanar if all its vertices lie in the outer face. We enumerate various classes of root...
AbstractLet G be a planar graph and W a set of vertices, G is W-outerplanar if it can be embedded in...
AbstractAnouterplanargraph is one that can be embedded in the plane so that all of the vertices lie ...
AbstractWe show an algorithm for constructing O(dnlogn) area outerplanar straight-line drawings of n...
AbstractIn this paper, we have studied seven colorings of outerplanar graphs. Two main conclusions h...
AbstractLet G be a planar graph and W a set of vertices, G is W-outerplanar if it can be embedded in...
An outerplanar (also called circular, convex, one-page) drawing of an n-vertex graph G is a drawing ...
AbstractThe paper presents several characterizations of outerplanar graphs, some of them are counter...
AbstractAnouterplanargraph is one that can be embedded in the plane so that all of the vertices lie ...
Let $H$ be a graph. The generalized outerplanar Tur\'an number of $H$, denoted by $f_{\mathcal{OP}}(...
AbstractUlam's conjecture is that a graph G with at least three vertices can be reconstructed from t...
summary:In this Note, we study infinite graphs with locally finite outerplane embeddings, given a ch...
B$_0$-VPG graphs are intersection graphs of axis-parallel line segments in the plane. In this paper,...
International audienceThis paper is concerned with the counting and random sampling of plane graphs ...
summary:In this Note, we study infinite graphs with locally finite outerplane embeddings, given a ch...