Related papers: Euler-genus distributions of cubic Halin graphs
We derive a quadratic-time algorithm for the genus distribution of any 3-regular, biconnected series-parallel graph, which we extend to any biconnected series-parallel graph of maximum degree at most 3. Since the biconnected components of…
Given an Eulerian digraph, we consider the genus distribution of its face-oriented embeddings. We prove that such distribution is log-concave for two families of Eulerian digraphs, thus giving a positive answer for these families to a…
The Euler genus of a graph is a fundamental and well-studied parameter in graph theory and topology. Computing it has been shown to be NP-hard by [Thomassen '89 & '93], and it is known to be fixed-parameter tractable. However, the…
Computing the Euler genus of a graph is a fundamental problem in graph theory and topology. It has been shown to be NP-hard by [Thomassen '89] and a linear-time fixed-parameter algorithm has been obtained by [Mohar '99]. Despite extensive…
Halin graphs constitute an interesting class of planar and polyhedral graphs. A generalized Halin graph is obtained by connecting all leaves of a planar embedding of a tree via a cycle. A Halin graph is a generalized Halin graph having no…
In this article we present theoretical and computational results on the existence of polyhedral embeddings of graphs. The emphasis is on cubic graphs. We also describe an efficient algorithm to compute all polyhedral embeddings of a given…
By using the Transfer Matrix Method, explicit formulas for the embedding distribution of doubly hexagonal chain graphs are computed.
In this paper, we find and prove that, under some conditions, the embedding distributions of $H$-linear graph families with spiders are asymptotic normal distributions. It can been seen a version of central limit theorem in topological…
We develop a theory of confluence of graphs. We describe an algorithm for proving that a given system of reduction rules for abstract graphs and graphs in surfaces is locally confluent. We apply this algorithm to show that each simple Lie…
We design a recursive algorithm to compute the partition function of the Ising model, summed over cubic maps with fixed size and genus. The algorithm runs in polynomial time, which is much faster than methods based on a Tutte-like, or…
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm to exactly sample a random ET of the given generalized…
We compute the elliptic genera of two-dimensional N=(2,2) and N=(0,2) gauged linear sigma models via supersymmetric localization, for rank-one gauge groups. The elliptic genus is expressed as a sum over residues of a meromorphic function…
We consider the problem of sampling from the uniform distribution on the set of Eulerian orientations of subgraphs of the triangular lattice. Although it is known that this can be achieved in polynomial time for any graph, the algorithm…
For an $n$-fold geometrically cyclic branched covering $Y$ of a smooth, projective scheme $X$ branched at a smooth closed subscheme $Z\subset X$ with $n \in k^\times$, we compute the quadratic Euler characteristic of $Y$ in terms of certain…
The aim of this paper is to derive on the basis of the Euler's formula several analytical relations which hold for certain classes of planar graphs and which can be useful in algorithmic graph theory.
We describe and implement two local reduction rules that can be used to recognize Halin graphs in linear time, avoiding the complicated planarity testing step of previous linear time Halin graph recognition algorithms. The same two rules…
We present formulas to compute the P3-geodetic number, the P3-hull number and the percolation time for a caterpillar, in terms of certain sequences associated with it. In addition, we find a connection between the percolation time of a unit…
In the symmetric group on a set of size 2n, let P_{2n} denote the conjugacy class of involutions with no fixed points (equivalently, we refer to these as ``pairings'', since each disjoint cycle has length 2). Harer and Zagier explicitly…
In this paper, we first generalize a theorem for counting the number of faces of an oriented embedding of a graph that passing through a given cut-edge set [S. Stahl, Trans. Amer. Math. Soc. 259 (1980), 129--145] to all surfaces. Then we…
The genus graphs have been studied by many authors, but just a few results concerning in special cases: Planar, Toroidal, Complete, Bipartite and Cartesian Product of Bipartite. We present here a derive general lower bound for the genus of…