Balanced C{sub}4-bowtie decomposition algorithm of complete graphs

摘要

In graph theory, the decomposition problem of graphs are very important topics. Various types of decompositions of many graphs can be seen in the literature of graph theory. This paper gives a balanced C{sub}4-bowtie decomposition algorithm of the complete graph K{sub}n.