For any simple graph $G$ on $n$ vertices, write its chromatic polynomial in the rising factorial basis as $P(G,x)=\sum_{j=0}^{n}(-1)^{n-j}c_j x^{\langle j\rangle}$, where $x^{\langle j\rangle}=\prod_{i=0}^{j-1}(x+i)$ for any $j\ge 1$ and $x^{\langle0\rangle}=1$. Brenti (1992) introduced the $\tau$-polynomial and its au...
For any graph $G$, let $P(G,k)$ and $P_{\ell}(G,k)$ denote the chromatic polynomial and the list-color function of $G$, respectively. It remains an open problem whether, for every graph $G$ and integer $k$, the equality $P(G,k)=P_{\ell}(G,k)>0$ implies that $P(G,k+1)=P_{\ell}(G,k+1)$ also holds. In this paper, we answe...
Let $G$ be a simple graph with maximum degree $\Delta\ge 3$, and let $P(G,k)$ denote its chromatic polynomial. For each positive integer $k$, the list-color function $P_{\ell}(G,k)$ is the minimum number of $L$-colorings of $G$ over all $k$-assignments $L$. In this paper, we prove that $P_{\ell}(G,k)=P(G,k)$ for every...
Mei-Qiao Zhang, Feng-Ming Dong· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.