Abstract:
In the article, the following problems connected with the edge clique coverings of graphs are investigated: the structure of graphs whose edges can be covered by cliques with only one way; the possibility of graph reducing with the order decrease not changing the edge clique covering structure; algorithms for construction of minimal edge clique coverings; the interrelation between isomorphisms of graphs and corresponding reduced graphs.