Enumerating graph embeddings and partial-duals by genus and Euler genus
From MaRDI portal
Publication:5093426
DOI10.54550/ECA2021V1S1S1zbMath1491.05006OpenAlexW3209143274MaRDI QIDQ5093426
Jonathan L. Gross, Thomas W. Tucker
Publication date: 26 July 2022
Published in: Enumerative Combinatorics and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.54550/eca2021v1s1s1
Graph polynomials (05C31) Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Genus distributions for iterated claws
- Total embedding distributions of Ringel ladders
- Genus distributions of 4-regular outerplanar graphs
- On the genus distribution of \((p,q,n)\)-dipoles
- Generalized duality for graphs on surfaces and the signed Bollobás-Riordan polynomial
- The directed genus of the de Bruijn graph
- Permutation-partition pairs. III: Embedding distributions of linear families of graphs
- An obstruction to embedding graphs in surfaces
- Genus distributions for bouquets of circles
- A partial k-arboretum of graphs with bounded treewidth
- Overlap matrices and total imbedding distributions
- The genus problem for cubic graphs
- Genus distribution of Ringel ladders
- Total embedding distributions for bouquets of circles
- On the genus distributions of wheels and of related graphs
- Ribbon graphs and their invariants derived from quantum groups
- Embedding digraphs on orientable surfaces
- Obstructions to directed embeddings of Eulerian digraphs in the plane
- Partial duality for ribbon graphs. I: distributions
- Über simpliziale Zerfällungen beliebiger (endlicher oder unendlicher) Graphen
- Enumeration of digraph embeddings
- Iterated claws have real-rooted genus polynomials
- Total Embedding Distributions of Circular Ladders
- Genus distributions of graphs under self-edge-amalgamations
- Embeddings of cubic Halin graphs: Genus distributions
- Genus Distributions of cubic series-parallel graphs
- Embeddings of graphs of fixed treewidth and bounded degree
- The graph genus problem is NP-complete
- Log-concavity of genus distributions for circular ladders
- Genus distributions of graphs under edge-amalgamations
- Graph minors. II. Algorithmic aspects of tree-width
- Hierarchy for imbedding-distribution invariants of a graph
- Counting Cycles in Permutations by Group Characters, With an Application to a Topological Problem
- Theory of Maps on Orientable Surfaces
- On the Zeros of Some Genus Polynomials
- An Euler‐genus approach to the calculation of the crosscap‐number polynomial
- Calculating genus polynomials via string operations and matrices
- Graphs on Surfaces
- Embedding Distributions of Generalized Fan Graphs
- On a Conjecture of S. Stahl
- Log-Concavity of the Genus Polynomials of Ringel Ladders
- Recurrences for the genus polynomials of linear sequences of graphs
- Log-Concavity of Combinations of Sequences and Applications to Genus Distributions
- Genus polynomials and crosscap‐number polynomials for ring‐like graphs
- SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
- Orientable embedding of Cayley graphs
This page was built for publication: Enumerating graph embeddings and partial-duals by genus and Euler genus
