Rooted planar maps modulo some patterns
From MaRDI portal
Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Combinatorics on words (68R15)
Recommendations
Cites work
- A Census of Planar Maps
- Bijective counting of tree-rooted maps and shuffles of parenthesis systems
- Counting non-isomorphic three-connected planar maps
- Counting rooted maps by genus. II
- Counting strings in Dyck paths
- Dyck path enumeration
- Enumeration des graphes planaires à l'aide des séries formelles en variables non commutatives
- Equivalence classes of Dyck paths modulo some statistics
- Equivalence classes of Motzkin paths modulo a pattern of length at most two
- Equivalence classes of permutations modulo excedances
- scientific article; zbMATH DE number 1919514 (Why is no real title available?)
- scientific article; zbMATH DE number 6272293 (Why is no real title available?)
- On the enumeration of planar maps
- Some statistics on Dyck paths
- Statistics on Dyck paths
- The On-Line Encyclopedia of Integer Sequences
- Une relation fonctionnelle nouvelle sur les cartes planaires pointées
Cited in
(2)
This page was built for publication: Rooted planar maps modulo some patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q906462)