Enumerative applications of a decomposition for graphs and digraphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4099342 (Why is no real title available?)
- scientific article; zbMATH DE number 67324 (Why is no real title available?)
- scientific article; zbMATH DE number 67325 (Why is no real title available?)
- scientific article; zbMATH DE number 3508512 (Why is no real title available?)
- scientific article; zbMATH DE number 3445271 (Why is no real title available?)
- scientific article; zbMATH DE number 3419161 (Why is no real title available?)
- A Contribution to the Theory of Chromatic Polynomials
- A Noncommutative Generalization and q-Analog of the Lagrange Inversion Formula
- Depth-first search as a combinatorial correspondence
- Enumeration of trees by inversions
- Nombres d'Euler et inversions dans les arbres
- On external activity and inversions in trees
- The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions
- The inversion enumerator for labeled trees
- Une famille de polynômes ayant plusieurs propriétés enumeratives
Cited in
(28)- LLT cumulants and graph coloring
- Exact enumeration of satisfiable 2-SAT formulae
- Listing subgraphs by Cartesian decomposition
- Cayley compositions, partitions, polytopes, and geometric bijections
- On the Tutte and Matching Polynomials for Complete Graphs
- Applications of the Wold decomposition to the study of row contractions associated with directed graphs
- Counting acyclic and strong digraphs by descents
- On Operator and Formal Sum Methods for Graph Enumeration Problems
- Macdonald cumulants, \(G\)-inversion polynomials and \(G\)-parking functions
- Enumerations, forbidden subgraph characterizations, and the split-decomposition
- Flow polytopes and the space of diagonal harmonics
- Counting acyclic digraphs by sources and sinks
- The partition theorem of connected digraphs and its enumerative applications.
- Symbolic method and directed graph enumeration
- Trees, parking functions and factorizations of full cycles
- Parking functions and tree inversions revisited
- Generating functions of some families of directed uniform hypergraphs
- \(G\)-parking functions and tree inversions
- A combinatorial link between labelled graphs and increasingly labelled Schröder trees
- On sequences of polynomials arising from graph invariants
- scientific article; zbMATH DE number 1472110 (Why is no real title available?)
- An insertion algorithm on multiset partitions with applications to diagram algebras
- Möbius coinvariants and bipartite edge-rooted forests
- A complete grammar for decomposing a family of graphs into 3-connected components
- scientific article; zbMATH DE number 6322906 (Why is no real title available?)
- Parking functions, tree depth and factorizations of the full cycle into transpositions
- Trees, parking functions, and standard monomials of skeleton ideals
- Triangulations of Cayley and Tutte polytopes
This page was built for publication: Enumerative applications of a decomposition for graphs and digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1893989)