Partial duality for ribbon graphs. III: A gray code algorithm for enumeration

DOI10.1007/s10801-021-01040-yzbMath1479.05076OpenAlexW3148485500MaRDI QIDQ825536

Thomas W. Tucker, Toufik Mansour, Jonathan L. Gross

Publication date: 17 December 2021

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

Full work available at URL: https://doi.org/10.1007/s10801-021-01040-y

zbMATH Keywords

Poincaré dualGray coderibbon graphPetrie dualpartial dualityrotation systemEuler-genusgenus polynomial

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)

Related Items (2)

Parallel edges in ribbon graphs and interpolating behavior of partial-duality polynomials ⋮ Partial duality for ribbon graphs. II: Partial-twuality polynomials and monodromy computations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Separability and the genus of a partial dual
• A polynomial of graphs on surfaces
• Generalized duality for graphs on surfaces and the signed Bollobás-Riordan polynomial
• Partial duality and Bollobás and Riordan's ribbon graph polynomial
• Operators over regular maps
• Genus distributions for bouquets of circles
• Ribbon graphs and their invariants derived from quantum groups
• Partial duality for ribbon graphs. I: distributions
• Partial duality for ribbon graphs. II: Partial-twuality polynomials and monodromy computations
• A Polynomial Invariant of Graphs On Orientable Surfaces
• Twisted duality for embedded graphs
• Theory of Maps on Orientable Surfaces
• Graphs on Surfaces
• Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations

This page was built for publication: Partial duality for ribbon graphs. III: A gray code algorithm for enumeration