On chromatic and dichromatic sum equations (Q2640611): Difference between revisions

Let M be a map treated as a 2-cell embedding of an underlying graph into the surface. The set of all the maps being considered is denoted by \({\mathcal M}\). P(M,\(\lambda\)) is the chromatic polynomial of the underlying graph of M. Let \({\mathcal N}=\{n_ 1,n_ 2,...,n_ i,...\}\) be a set of combinatorial invariants for graphs, a function g is introduced as \[ (*)\quad g=g(y_ 1,y_ 2,...,\lambda)=\sum_{M\in {\mathcal M}}P(M;\lambda)\prod_{i\geq 1}y_ i^{n_ i(M)}. \] The problem is to determine the functional equation satisfied by g which is called the chromatic sum function defined by (*) for \({\mathcal M}\), N given. This paper provides an exposition on the theory of chromatic sums for rooted planar triangulation and nonseparable planar maps.