One means of constructing triangle-free graphs
LI Xue-feng · Journal of Xi'an University of Post and Telecommunications · 2009
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.