scientific article; zbMATH DE number 7203453
From MaRDI portal
Publication:5110993
zbMath1440.05175MaRDI QIDQ5110993
Publication date: 26 May 2020
Full work available at URL: https://dmtcs.episciences.org/6340
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trees (05C05) Combinatorial aspects of representation theory (05E10) Enumeration in graph theory (05C30) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (3)
\(k\)-indivisible noncrossing partitions ⋮ Trees, parking functions and factorizations of full cycles ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A ridiculously simple and explicit implicit function theorem
- Hook length formulas for trees by Han's expansion
- A solution to a problem of Dénes: A bijection between trees and factorizations of cyclic permutations
- Une famille de polynômes ayant plusieurs propriétés enumeratives
- The combinatorial relationship between trees, cacti and certain connection coefficients for the symmetric group
- Generalized tree inversions and \(k\)-parking functions
- Enumeration of planar constellations
- Parking functions of types A and B
- Tree-like properties of cycle factorizations
- Conjectured statistics for the \(q,t\)-Catalan numbers.
- Enumerative applications of a decomposition for graphs and digraphs
- The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions
- Minimal Transitive Factorizations of Permutations into Cycles
- A Noncommutative Generalization and q-Analog of the Lagrange Inversion Formula
- An Occupancy Discipline and Applications
- The inversion enumerator for labeled trees
- Transitive factorisations into transpositions and holomorphic mappings on the sphere
This page was built for publication:
