Genus polynomials of ladder-like sequences of graphs

DOI10.1007/s10801-019-00897-4zbMath1453.05052OpenAlexW2967838148WikidataQ127356245 ScholiaQ127356245MaRDI QIDQ2196486

Thomas W. Tucker, Yi-Chao Chen, Toufik Mansour, Jonathan L. Gross

Publication date: 2 September 2020

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10801-019-00897-4

zbMATH Keywords

production matricesgenus polynomialsimbedding typeslinear sequences of graphspartial genus polynomialsstring operations

Mathematics Subject Classification ID

Graph polynomials (05C31) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items

Unnamed Item, Limit for the Euler-genus distributions of ladder-like sequences of graphs, Partial duality for ribbon graphs. I: distributions, Limits for embedding distributions

Cites Work

• Unnamed Item
• Unnamed Item
• Genus distributions for two classes of graphs
• Permutation-partition pairs. III: Embedding distributions of linear families of graphs
• Genus distributions for bouquets of circles
• A unified approach to polynomial sequences with only real zeros
• A Kuratowski-type theorem for the maximum genus of a graph
• Embeddings of graphs of fixed treewidth and bounded degree
• The graph genus problem is NP-complete
• Hierarchy for imbedding-distribution invariants of a graph
• Calculating genus polynomials via string operations and matrices
• The Genus, Regional Number, and Betti Number of a Graph