Enumerating graph embeddings and partial-duals by genus and Euler genus
From MaRDI portal
(Redirected from Enumerating graph embeddings and partial-duals by genus and Euler genus)
Recommendations
- Partial duality for ribbon graphs. I: distributions
- Partial-dual Euler-genus distributions for bouquets with small Euler genus
- Partial duality for ribbon graphs. III: A gray code algorithm for enumeration
- Genus polynomials of cycles with double edges
- Partial duality for ribbon graphs. II: Partial-twuality polynomials and monodromy computations
Cites work
- A partial k-arboretum of graphs with bounded treewidth
- An Euler-genus approach to the calculation of the crosscap-number polynomial
- An obstruction to embedding graphs in surfaces
- Calculating genus polynomials via string operations and matrices
- Counting Cycles in Permutations by Group Characters, With an Application to a Topological Problem
- Embedding digraphs on orientable surfaces
- Embedding distributions of generalized fan graphs
- Embeddings of cubic Halin graphs: genus distributions
- Embeddings of graphs of fixed treewidth and bounded degree
- Enumeration of digraph embeddings
- Generalized duality for graphs on surfaces and the signed Bollobás-Riordan polynomial
- Genus distribution of graph amalgamations: pasting at root-vertices.
- Genus distribution of graph amalgamations: self-pasting at root-vertices
- Genus distribution of Ringel ladders
- Genus distributions for bouquets of circles
- Genus distributions for iterated claws
- Genus distributions of 4-regular outerplanar graphs
- Genus distributions of cubic series-parallel graphs
- Genus distributions of graphs under edge-amalgamations
- Genus distributions of graphs under self-edge-amalgamations
- Genus polynomials and crosscap‐number polynomials for ring‐like graphs
- Graph minors. II. Algorithmic aspects of tree-width
- Graphs of groups on surfaces. Interactions and models
- Graphs on surfaces
- Graphs on surfaces. Dualities, polynomials, and knots
- Hierarchy for imbedding-distribution invariants of a graph
- scientific article; zbMATH DE number 4006288 (Why is no real title available?)
- scientific article; zbMATH DE number 48688 (Why is no real title available?)
- scientific article; zbMATH DE number 3523580 (Why is no real title available?)
- scientific article; zbMATH DE number 474668 (Why is no real title available?)
- scientific article; zbMATH DE number 919921 (Why is no real title available?)
- Iterated claws have real-rooted genus polynomials
- Log-Concavity of Combinations of Sequences and Applications to Genus Distributions
- Log-concavity of genus distributions for circular ladders
- Log-concavity of the genus polynomials of Ringel ladders
- Obstructions to directed embeddings of Eulerian digraphs in the plane
- On a Conjecture of S. Stahl
- On the genus distribution of (p,q,n)-dipoles
- On the genus distributions of wheels and of related graphs
- On the Zeros of Some Genus Polynomials
- Orientable embedding of Cayley graphs
- Overlap matrices and total imbedding distributions
- Partial duality for ribbon graphs. I: distributions
- Permutation-partition pairs. III: Embedding distributions of linear families of graphs
- Recurrences for the genus polynomials of linear sequences of graphs
- Ribbon graphs and their invariants derived from quantum groups
- SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
- The directed genus of the de Bruijn graph
- The genus problem for cubic graphs
- The graph genus problem is NP-complete
- Theory of Maps on Orientable Surfaces
- Total embedding distributions for bouquets of circles
- Total embedding distributions of circular ladders
- Total embedding distributions of Ringel ladders
- Valence-partitioned genus polynomials and their application to generalized dipoles
- Über simpliziale Zerfällungen beliebiger (endlicher oder unendlicher) Graphen
Cited in
(11)- Enumeration of graph embeddings
- Partial duality of hypermaps
- Genus polynomials of cycles with double edges
- Valence-partitioned genus polynomials and their application to generalized dipoles
- Euler's enumerations
- Partial-dual genus polynomial as a weight system
- Partial duality for ribbon graphs
- Partial-duals for plane ribbon graphs
- Partial duality for ribbon graphs. III: A gray code algorithm for enumeration
- Genus embeddings of a type of graph
- Annular embeddings of permutations for arbitrary genus
This page was built for publication: Enumerating graph embeddings and partial-duals by genus and Euler genus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5093426)
