The drop polynomial of a weighted digraph
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 6016068 (Why is no real title available?)
- scientific article; zbMATH DE number 718142 (Why is no real title available?)
- scientific article; zbMATH DE number 1369835 (Why is no real title available?)
- scientific article; zbMATH DE number 3049182 (Why is no real title available?)
- A note on the binomial drop polynomial of a poset
- A symmetric function generalization of the chromatic polynomial of a graph
- Acyclic orientations of graphs
- Complexity of the Cover Polynomial
- Contraction-deletion invariants for graphs
- Descents, quasi-symmetric functions, Robinson-Schensted for posets, and the chromatic symmetric function
- Factorization of the cover polynomial
- Further investigation involving rook polynomials with only real zeros
- Generalized rook polynomials
- Juggling Drops and Descents
- On the computational complexity of the Jones and Tutte polynomials
- On the cover polynomial of a digraph
- Rook theory and cycle-counting permutation statistics
- Rook theory. III: Rook polynomials and the chromatic structure of graphs
- The cycle-path indicator polynomial of a digraph
- The matrix cover polynomial
- The path-cycle symmetric function of a digraph
- The vertex-cover polynomial of a graph
This page was built for publication: The drop polynomial of a weighted digraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2399350)