Recurrences for the genus polynomials of linear sequences of graphs

DOI10.1515/MS-2017-0368MaRDI QIDQ5142379zbMATH OpenOpenAlexFDO

Authors Yichao Chen, Jonathan L. Gross, Toufik Mansour, Thomas W. Tucker

Publication date 30 December 2020

Published in Mathematica Slovaca (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/ms-2017-0368

Mathematics Subject Classification ID

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

Cited in

(7)

• Limits for embedding distributions
• Partial duality for ribbon graphs. II: Partial-twuality polynomials and monodromy computations
• A character approach to directed genus distribution of graphs: the bipartite single-black-vertex case
• Calculating genus polynomials via string operations and matrices
• Enumerating graph embeddings and partial-duals by genus and Euler genus
• Embeddings of circular ladder-like graph families
• Strong log-convexity of genus sequences

This page was built for publication: Recurrences for the genus polynomials of linear sequences of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5142379)