The Chromaticity of One Kind of Graphs

Lan Xiuqing Wang Chaorui. The Chromaticity of One Kind of GraphsJ. Transactions of Beijing institute of Technology, 1990, (2): 1-3.

Citation:

Lan Xiuqing Wang Chaorui. The Chromaticity of One Kind of GraphsJ. Transactions of Beijing institute of Technology, 1990, (2): 1-3.

Citation:

Lan Xiuqing Wang Chaorui. The Chromaticity of One Kind of GraphsJ. Transactions of Beijing institute of Technology, 1990, (2): 1-3.

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 .

FullText(HTML)

Turn off MathJax

Article Contents

Export File