Log-Concavity of the Genus Polynomials of Ringel Ladders
From MaRDI portal
Publication:5006559
DOI10.5614/ejgta.2015.3.2.1zbMath1467.05014arXiv1501.06106OpenAlexW2963206720MaRDI QIDQ5006559
Jonathan L. Gross, Toufik Mansour, Thomas W. Tucker, David G. L. Wang
Publication date: 16 August 2021
Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.06106
Exact enumeration problems, generating functions (05A15) Combinatorial inequalities (05A20) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items
Enumerating graph embeddings and partial-duals by genus and Euler genus ⋮ Genus distributions for iterated claws ⋮ Partial duality for ribbon graphs. I: distributions ⋮ Interlace polynomials of friendship graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matchings, cycle bases, and the maximum genus of a graph
- Genus distributions of 4-regular outerplanar graphs
- Permutation-partition pairs. III: Embedding distributions of linear families of graphs
- Genus distributions for bouquets of circles
- Genus distribution of Ringel ladders
- Embedding digraphs on orientable surfaces
- A unified approach to polynomial sequences with only real zeros
- Enumeration of digraph embeddings
- Embeddings of cubic Halin graphs: Genus distributions
- Embeddings of graphs of fixed treewidth and bounded degree
- Genus distributions of graphs under edge-amalgamations
- Hierarchy for imbedding-distribution invariants of a graph
- On the Zeros of Some Genus Polynomials
- Log-Concavity of Combinations of Sequences and Applications to Genus Distributions
- SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
- Orientable embedding of Cayley graphs