搜索结果: 1-1 共查到“组合数学 chromatic polynomial”相关记录1条 . 查询时间(0.101 秒)
Abstract: The degree chromatic polynomial $Pm(G,k)$ of a graph $G$ counts the number of $k$-colorings in which no vertex has $m$ adjacent vertices of its same color. We prove Humpert and Martin's conj...