Permutation-Partition Pairs II: Bounds on the Genus of the Amalgamation of Graphs

DOI10.2307/1998757zbMath0495.05019OpenAlexW4254222195MaRDI QIDQ3958480

Saul Stahl

Publication date: 1982

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/1998757

zbMATH Keywords

amalgamation of graphspermutation pairmaximum orbiticity

Mathematics Subject Classification ID

Trees (05C05) Combinatorial aspects of partitions of integers (05A17) Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Directed graphs (digraphs), tournaments (05C20)

Related Items (10)

Bounds for the average genus of the vertex-amalgamation of graphs ⋮ Permutation-partition pairs. III: Embedding distributions of linear families of graphs ⋮ A note on the directed genus of K_n,n,n and K_n ⋮ Enumeration of digraph embeddings ⋮ Region distributions of graph embeddings and Stirling numbers ⋮ On the number of maximum genus embeddings of almost all graphs ⋮ A note on directed genera of some tournaments ⋮ A combinatorial analog of the Jordan Curve Theorem ⋮ Infinite Eulerian tessellations ⋮ Region distributions of some small diameter graphs

This page was built for publication: Permutation-Partition Pairs II: Bounds on the Genus of the Amalgamation of Graphs