Permutation-Partition Pairs: A Combinatorial Generalization of Graph Embeddings

DOI10.2307/1998149MaRDI QIDQ3882482zbMATH OpenOpenAlexFDO

Authors Saul Stahl

Publication date 1980

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

zbMATH Keywords

cyclic permutationdisjoint cycle decomposition of a permutationgraph embeddingsmaximum orbiticityorbitspermutation- partitionrotation systemtopological graph theory

Mathematics Subject Classification ID

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

Cited in

(16)

• On the Euler genus of a 2-connected graph
• On the non-orientable genus of a 2-connected graph
• Computing the genus of the 2-amalgamations of graphs
• An additivity theorem for the genus of a graph
• Permutation-partition pairs. III: Embedding distributions of linear families of graphs
• Combinatorial maps
• On the number of maximum genus embeddings of almost all graphs
• Genus distributions for bouquets of circles
• A Nebeský-type characterization for relative maximum genus
• On the genus distributions of wheels and of related graphs
• A combinatorial analog of the Jordan Curve Theorem
• Bounds for the average genus of the vertex-amalgamation of graphs
• scientific article; zbMATH DE number 7559239 (Why is no real title available?)
• Discrete Jordan curve theorems
• Pre-signed graphs: a reformulation of signed graphs and their embeddings
• Region distributions of some small diameter graphs

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

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