Planar Permutation Graphs

I present an efficient algorithm which lists the minimal separators of a 3- connected planar graph in O(n) per separator.. Keywords: 3-connected planar graphs, minimal

We will now prove that the complexity of finding the a, ∗-minimal separators of a planar graph is O(n/separator) and that the complexity of finding all the minimal separators of

However, since the graph is 3-connected planar, anyone of these neighbourhoods is necessarily maximal for inclusion, because if some neighbourhood S was a strict subset of some

Seara, On the Steiner, geodetic and hull number of graphs, Discrete Math. Canoy, Jr., The Edge Steiner Number of a Graph, Bulletin of

Abstract: In the framework of graph transformation systems with Negative Ap- plication Conditions (NACs) the classical notion of switch equivalence of deriva- tions is extended

We give the coefficients of the irreducible characters of the symmetric group that contribute to the number of cycles of a permutation, considered as a class function of

Assume A is a family of connected planar graphs that satisfies the previous condition, and let X n denote the number of connected components that belong to A in a random planar

384 Manuel Bodirsky, Omer Gim´enez, Mihyun Kang and Marc Noy In this paper we study the enumeration of labelled series-parallel and outerplanar graphs.. From now on, unless