Bivariate order polynomials
From MaRDI portal
Abstract: Motivated by Dohmen-P"onitz-Tittmann's bivariate chromatic polynomial , which counts all -colorings of a graph such that adjacent vertices get different colors if they are , we introduce a bivarate version of Stanley's order polynomial, which counts order preserving maps from a given poset to a chain. Our results include decomposition formulas in terms of linear extensions, a combinatorial reciprocity theorem, and connections to bivariate chromatic polynomials.
Recommendations
Cites work
- scientific article; zbMATH DE number 6016068 (Why is no real title available?)
- scientific article; zbMATH DE number 2038883 (Why is no real title available?)
- scientific article; zbMATH DE number 3341135 (Why is no real title available?)
- A bivariate chromatic polynomial for signed graphs
- Acyclic orientations of graphs
- An extension of the bivariate chromatic polynomial
- Closed-form expansions for the universal edge elimination polynomial
- Fibonacci Identities and Graph Colorings
Cited in
(5)
This page was built for publication: Bivariate order polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2191257)