相关论文: Euler-genus distributions of cubic Halin graphs

We first prove a one-to-one correspondence between finding Hamiltonian cycles in a cubic planar graphs and finding trees with specific properties in dual graphs. Using this information, we construct an exact algorithm for finding…

In this paper, we give polynomial-time algorithms that can take a graph G with a given combinatorial embedding on an orientable surface S of genus g and produce a planar drawing of G in R^2, with a bounding face defined by a polygonal…

For every integer $g$, isomorphism of graphs of Euler genus at most $g$ can be decided in linear time. This improves previously known algorithms whose time complexity is $n^{O(g)}$ (shown in early 1980's), and in fact, this is the first…

Let $p$ be an odd prime, and $D_{2p}=\langle a,b\mid a^p=b^2=1,bab=a^{-1}\rangle$ the dihedral group of order $2p$. In this paper, we completely classify the cubic Cayley graphs on $D_{2p}$ up to isomorphism by means of spectral method. By…

We consider the problem of generating uniformly random partitions of the vertex set of a graph such that every piece induces a connected subgraph. For the case where we want to have partitions with linearly many pieces of bounded size, we…

The elliptic genus for arbitrary two dimensional $N=2$ Landau-Ginzburg orbifolds is computed. This is used to search for possible mirror pairs of such models. An important aspect of this work is that there is no restriction to theories for…

The genus--g Fuss--Catalan (FC) number counts the number of ways to obtain a genus-g surface by identifying the edges of a pn--gon via p-valent hyperedges. For p=2 these are the genus--g Catalan numbers which are generated as the trace…

We analyze the distribution of unitarized L-polynomials Lp(T) (as p varies) obtained from a hyperelliptic curve of genus g <= 3 defined over Q. In the generic case, we find experimental agreement with a predicted correspondence (based on…

We define a generalization of the Eulerian polynomials and the Eulerian numbers by considering a descent statistic on segmented permutations coming from the study of 2-species exclusion processes and a change of basis in a Hopf algebra. We…

The concept of partial duality in hypermaps was introduced by Chmutov and Vignes-Tourneret, and Smith independently. This notion serves as a generalization of the concept of partial duality found in maps. In this paper, we first present an…

We provide a polynomial time algorithm to determine a cubic bipartite graph has a hamilton cycle or not.

The main object of this paper is to investigate a new class of the generalized Hurwitz type poly-Bernoulli numbers and polynomials from which we derive some algorithms for evaluating the Hurwitz type poly-Bernoulli numbers and polynomials.…

It has been recently shown that any graph of genus g>0 can be stochastically embedded into a distribution over planar graphs, with distortion Olog (g+1)) [Sidiropoulos, FOCS 2010]. This embedding can be computed in polynomial time, provided…

Double ramification loci parametrise marked curves where a weighted sum of the markings is linearly trivial; higher-rank loci are obtained by imposing several such conditions simultaneously. We obtain closed formulae for the orbifold Euler…

The structure of graphs with a 2-vertex-cut that are critical with respect to the Euler genus is studied. A general theorem describing the building blocks is presented. These constituents, called hoppers and cascades, are classified for the…

We show that for any fixed integer $k \geq 0$, there exists an algorithm that computes the diameter and the eccentricies of all vertices of an input unweighted, undirected $n$-vertex graph of Euler genus at most $k$ in time \[…

We give an algorithm to calculate the minimal and maximal genus of the orientable closed surface where a graph $G$ can be embedded. For this, we construct some special branched coverings of the 2-sphere. We apply this algorithm to calculate…

The $2$-cell embeddings of graphs on closed surfaces have been widely studied. It is well known that ($2$-cell) embedding a given graph $G$ on a closed orientable surface is equivalent to cyclically ordering the edges incident to each…

The characteristic polynomials of the adjacency matrix of line graphs of caterpillars and then the characteristic polynomials of their Laplacian or signless Laplacian matrices are characterized, using recursive formulas. Furthermore, the…

We construct {\it Topological Elliptic Genera}, homotopy-theoretic refinements of the elliptic genera for $SU$-manifolds and variants including the Witten-Landweber-Ochanine genus. The codomains are genuinely $G$-equivariant Topological…