Permutation-Partition Pairs: A Combinatorial Generalization of Graph Embeddings

DOI10.2307/1998149zbMath0441.05024OpenAlexW4230592946MaRDI QIDQ3882482

Saul Stahl

Publication date: 1980

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

zbMATH Keywords

orbitsgraph embeddingscyclic permutationtopological graph theoryrotation systemdisjoint cycle decomposition of a permutationmaximum orbiticitypermutation- partition

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Combinatorial inequalities (05A20) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (15)

Computing the genus of the 2-amalgamations of graphs ⋮ An additivity theorem for the genus of a graph ⋮ Bounds for the average genus of the vertex-amalgamation of graphs ⋮ Permutation-partition pairs. III: Embedding distributions of linear families of graphs ⋮ On the genus distributions of wheels and of related graphs ⋮ Combinatorial maps ⋮ On the number of maximum genus embeddings of almost all graphs ⋮ Unnamed Item ⋮ Discrete Jordan curve theorems ⋮ Genus distributions for bouquets of circles ⋮ A Nebeský-type characterization for relative maximum genus ⋮ A combinatorial analog of the Jordan Curve Theorem ⋮ Region distributions of some small diameter graphs ⋮ On the Euler genus of a 2-connected graph ⋮ On the non-orientable genus of a 2-connected graph

This page was built for publication: Permutation-Partition Pairs: A Combinatorial Generalization of Graph Embeddings