Polynomial sequences of binomial-type arising in graph theory
From MaRDI portal
Publication:405133
zbMath1300.05057arXiv1206.6174MaRDI QIDQ405133
Publication date: 4 September 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1206.6174
Umbral calculus (05A40) Graph polynomials (05C31) Combinatorial aspects of tessellation and tiling problems (05B45) Polyominoes (05B50)
Related Items
On the operations of sequences in rings and binomial type sequences, Bivariate affine Gončarov polynomials, Binomial sequences
Cites Work
- Unnamed Item
- The limit of chromatic polynomials
- Tutte polynomials and related asymptotic limiting functions for recursive families of graphs
- General structural results for Potts model partition functions on lattice strips
- Linked-cluster expansion of the graph-vertex coloration problem
- A new subgraph expansion for obtaining coloring polynomials for graphs
- On the foundations of combinatorial theory. VIII: Finite operator calculus