Shalosh B. Ekhad, Jocelyn Quaintance, Doron Zeilberger
Published 2011-03-31Version 1
This short article, dedicated to our beloved guru Philippe FLAJOLET (1948-2011), is a case-study in computer-generated combinatorial research, where the computer, all by itself, is using the transfer-matrix method to derive (rigorously!) rational generating functions for chromatic polynomials for infinite sequences of graphs generalizing the action of taking the Cartesian product with a path of length n, n=1,2,... .
Comments: 4 pages; Accompanied by Maple package http://www.math.rutgers.edu/~zeilberg/tokhniot/KamaTzviot . Sample input and output can be obtained from: http://www.math.rutgers.edu/~zeilberg/mamarim/mamarimhtml/tzeva.html
Distance domatic numbers for grid graphs
Minimum Weight Resolving Sets of Grid Graphs
Topology of total cut and cut complexes of grid graphs
![QR code for arXiv:1103.6206 [math.CO]](http://oss.arxitics.com/images/favicon.svg)