一类图的色性
The Chromaticity of One Kind of Graphs
-
摘要: 证明色多项式的根全为非负整数的4色图含有K_4子图,并讨论了此类图的色性。Abstract: This paper proves that all 4 - color graphs contion K4 - subgraphs if all the roots of their chromatic polynomials are not minus integers . It also studies the chromaticity of this kind of graphs .
下载: