On the complete width and edge clique cover problems

Van Bang Le, Sheng-Lung Peng

A complete graph is the graph in which every two vertices are adjacent. For a graph $G=(V,E)$, the complete width of $G$ is the minimum $k$ such that there exist $k$ independent se…