Results 1 
8 of
8
Genus distributions of cubic outerplanar graphs
, 2011
"... We present a quadratictime algorithm for computing the genus distribution of any 3regular outerplanar graph. Although recursions and some formulas for genus distributions have previously been calculated for bouquets and for various kinds of ladders and other special families of graphs, cubic outer ..."
Abstract

Cited by 13 (13 self)
 Add to MetaCart
We present a quadratictime algorithm for computing the genus distribution of any 3regular outerplanar graph. Although recursions and some formulas for genus distributions have previously been calculated for bouquets and for various kinds of ladders and other special families of graphs, cubic outerplanar graphs now emerge as the most general family of graphs whose genus distributions are known to be computable in polynomial time. The key algorithmic features are the syntheses of the given outerplanar graph by a sequence of edgeamalgamations of some of its subgraphs, in the order corresponding to the postorder traversal of a plane tree that we call the inner tree, and the coordination of that synthesis with justintime rootsplitting.
Genus distributions of graphs under selfedgeamalgamations
 Ars Math. Contemporanea
"... We investigate the wellknown problem of counting graph imbeddings on all oriented surfaces with a focus on graphs that are obtained by pasting together two rootedges of another base graph. We require that the partitioned genus distribution of the base graph with respect to these rootedges be know ..."
Abstract

Cited by 8 (8 self)
 Add to MetaCart
We investigate the wellknown problem of counting graph imbeddings on all oriented surfaces with a focus on graphs that are obtained by pasting together two rootedges of another base graph. We require that the partitioned genus distribution of the base graph with respect to these rootedges be known and that both rootedges have two 2valent endpoints. We derive general formulas for calculating the genus distributions of graphs that can be obtained either by selfcoamalgamating or by selfcontraamalgamating a base graph whose partitioned genus distribution is already known. We see how these general formulas provide a unified approach to calculating genus distributions of many new graph families, such as copasted and contrapasted closed chains of copies of the triangular prism graph, as well as graph families like circular and Möbius ladders with previously known solutions to the genus distribution problem.
Embeddings of cubic halin graphs: a surfacebysurface inventory
 Ars Mathematica Contemporanea
"... We derive an O(n2)time algorithm for calculating the sequence of numbers g0(G), g1(G), g2(G),... of distinct ways to embed a 3regular Halin graph G on the respective orientable surfaces S0, S1, S2,.... Key topological features are a quadrangular decomposition of plane Halin graphs and a new recomb ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
We derive an O(n2)time algorithm for calculating the sequence of numbers g0(G), g1(G), g2(G),... of distinct ways to embed a 3regular Halin graph G on the respective orientable surfaces S0, S1, S2,.... Key topological features are a quadrangular decomposition of plane Halin graphs and a new recombinantstrands reassembly process that fits pieces together threeatavertex. Key algorithmic features are reassembly along a postorder traversal, with justintime dynamic assignment of roots for quadrangular pieces encountered along the tour. 1.
Genus Distribution of P3✷Pn
"... We derive a recursion for the genus distribution of the graph family P3✷Pn, with the aid of a modified collection of doubleroot partials. We introduce a new kind of production, which corresponds to a surgical operation more complicated than the vertex or edgeamalgamation operations used in our ea ..."
Abstract
 Add to MetaCart
We derive a recursion for the genus distribution of the graph family P3✷Pn, with the aid of a modified collection of doubleroot partials. We introduce a new kind of production, which corresponds to a surgical operation more complicated than the vertex or edgeamalgamation operations used in our earlier work. 1
GENUS DISTRIBUTIONS OF STARLADDERS
"... Abstract. Starladder graphs were introduced by Gross in his development of a quadratictime algorithm for the genus distribution of a cubic outerplanar graph. This paper derives a formula for the genus distribution of starladder graphs, using Mohar’s overlap matrix and Chebyshev polynomials. Newly ..."
Abstract
 Add to MetaCart
Abstract. Starladder graphs were introduced by Gross in his development of a quadratictime algorithm for the genus distribution of a cubic outerplanar graph. This paper derives a formula for the genus distribution of starladder graphs, using Mohar’s overlap matrix and Chebyshev polynomials. Newly developed methods have led to a number of recent papers that derive genus distributions and total embedding distributions for various families of graphs. Our focus here is on a family of graphs called starladders. 1.
ARS MATHEMATICA CONTEMPORANEA x (xxxx) 1–x Genus Distributions of Graphs Under
"... We investigate the wellknown problem of counting graph imbeddings on all oriented surfaces with a focus on graphs that are obtained by pasting together two rootedges of another base graph. We require that the partitioned genus distribution of the base graph with respect to these rootedges be know ..."
Abstract
 Add to MetaCart
We investigate the wellknown problem of counting graph imbeddings on all oriented surfaces with a focus on graphs that are obtained by pasting together two rootedges of another base graph. We require that the partitioned genus distribution of the base graph with respect to these rootedges be known and that both rootedges have two 2valent endpoints. We derive general formulas for calculating the genus distributions of graphs that can be obtained either by selfcoamalgamating or by selfcontraamalgamating a base graph whose partitioned genus distribution is already known. We see how these general formulas provide a unified approach to calculating genus distributions of many new graph families, such as copasted and contrapasted closed chains of copies of the triangular prism graph, as well as graph families like circular and Möbius ladders with previously known solutions to the genus distribution problem.
DMFA Logo AMC Logo Embeddings of Graphs of Fixed Treewidth and Bounded Degree ∗
, 2013
"... Let F be any family of graphs of fixed treewidth and bounded degree. We construct a quadratictime algorithm for calculating the genus distribution of the graphs in F. Within a postorder traversal of the decomposition tree, the algorithm involves a fullpowered upgrading of production rules and roo ..."
Abstract
 Add to MetaCart
Let F be any family of graphs of fixed treewidth and bounded degree. We construct a quadratictime algorithm for calculating the genus distribution of the graphs in F. Within a postorder traversal of the decomposition tree, the algorithm involves a fullpowered upgrading of production rules and rootpopping. This algorithm for calculating genus distributions in quadratic time complements an algorithm of Kawarabayashi, Mohar, and Reed for calculating the minimum genus of a graph of bounded treewidth in linear time.