Transitivity and connectivity of permutations
From MaRDI portal
Publication:705750
Recommendations
Cited in
(13)- Hypermaps and indecomposable permutations
- The combinatorics of associated Hermite polynomials
- Indecomposable permutations, hypermaps and labeled Dyck paths
- Bifix codes and Sturmian words
- An atomic model of the graph of permutations linked by transpositions
- Connected chord diagrams and bridgeless maps
- On enumeration of families of genus zero permutations
- scientific article; zbMATH DE number 4064114 (Why is no real title available?)
- On the connected components of a random permutation graph with a given number of edges
- A few words about maps
- On Sillke's bijection
- On random trees obtained from permutation graphs
- New permutation coding and equidistribution of set-valued statistics
This page was built for publication: Transitivity and connectivity of permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q705750)