This paper introduced the graphs based on k_n connecting relations,and studied the coloring of these graphs and FCC by using "folding method".The proof of a necessary condition and an equivalent theorem of FCC was presented.Finally, the relative conjectur