Depth-first search as a combinatorial correspondence
From MaRDI portal
Publication:754887
Cites work
- scientific article; zbMATH DE number 3508512 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3294293 (Why is no real title available?)
- scientific article; zbMATH DE number 3344587 (Why is no real title available?)
- Enumeration Of Labelled Graphs
- The inversion enumerator for labeled trees
Cited in
(21)- Generalized parking functions, tree inversions, and multicolored graphs
- An area-depth symmetric \(q, t\)-Catalan polynomial
- Enumerative applications of a decomposition for graphs and digraphs
- Abelian quiver invariants and marginal wall-crossing.
- On the Tutte and Matching Polynomials for Complete Graphs
- On the evaluation of the Tutte polynomial at the points \((1, -1)\) and \((2, -1)\)
- Inverse descents of \(r\)-multipermutations
- Trees, parking functions and factorizations of full cycles
- From G-parking functions to B-parking functions
- Parking functions and tree inversions revisited
- Mahonian statistics on labeled forests
- Persistence for a class of order-one autoregressive processes and Mallows-Riordan polynomials
- The continuum limit of critical random graphs
- Forests and score vectors
- Parking functions: from combinatorics to probability
- A class of labeled posets and the Shi arrangement of hyperplanes
- Une famille de polynômes ayant plusieurs propriétés enumeratives
- Conjectures on the quotient ring by diagonal invariants
- Nombres d'Euler et inversions dans les arbres
- On external activity and inversions in trees
- Triangulations of Cayley and Tutte polytopes
This page was built for publication: Depth-first search as a combinatorial correspondence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q754887)