A Coloring Problem
From MaRDI portal
Recommendations
Cited in
(23)- Permutations with extremal number of fixed points
- On the mean chromatic number
- The \(r\)-multipermutations
- Polytopes, permutation shapes and bin packing
- On the (co)homology of the partition lattice and the free Lie algebra.
- A unified approach to polynomial sequences with only real zeros
- A combinatorial proof of a result of Gessel and Greene
- Unimodality and coloured hook factorisation
- Counting permutations by runs
- scientific article; zbMATH DE number 6381708 (Why is no real title available?)
- scientific article; zbMATH DE number 5844107 (Why is no real title available?)
- The Colouring Number
- A passage time for greedy‐coloring cycles
- A Question of Protocol
- scientific article; zbMATH DE number 817188 (Why is no real title available?)
- The -positivity of basic Eulerian polynomials via group actions
- The q-tangent and q-secant numbers via basic Eulerian polynomials
- A new decomposition of derangements
- Colouring solutions of the ice problem
- An isomorphism between projective models of toric and hyperplane graphic arrangements
- Desarrangements revisited: statistics and pattern avoidance
- Fix-Mahonian calculus. III: a quadruple distribution
- Fix-Mahonian calculus. II: Further statistics
This page was built for publication: A Coloring Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3983387)