不含三角形的图称为三角形无关图,本文给出了一种构造三角形无关图的方法,并通过具体构造说明对任意正整数k都可构造出五一色三角形无关图。
A graph is said to be a triangle - free graph if it doesn't contain any triangles. In this paper, one means of constructing triangle- free graphs is given, and specific construction showed that we could obtain k - color and triangle - free graphs for any non - negative integer k.