Duplicate Stained Problem of n-order Complete Graph

Cai Yu-ze · 2006

This paper drew some conclusions on the numbers of the homochromatic triangle and it did a simple extension of an n-order complete graph by making a preliminary investigation on the duplicate stained problem of 7-order complete graph.

Read the paper · More papers on PaperTik