Geodesic
Some properties of graph edge clique coverings
Prikladnaâ diskretnaâ matematika, no. 10 (2009), pp. 95-96 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

Edge clique coverings are investigated in graph theory for a long time. It is shown in some works that if the number of cliques in the minimal edge clique covering is fixed we can make estimation on some important graph characteristics. Also graph representation as a set of cliques can reduce the size of memory needed to keep the graph in it. Some important problems of edge clique coverings are investigated in the article including some properties of edge clique covering structure and construction of the minimal edge clique covering. There are investigated several features of graphs for which the task of finding the minimal edge clique covering can be divided into smaller parts which give less complexity in sum. Besides, the heuristic algorithm is proposed for constructing the edge clique covering of a graph. 
@article{PDM_2009_10_a48,
     author = {I. A. Badeha and P. V. Roldugin},
     title = {Some properties of graph edge clique coverings},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {95--96},
     year = {2009},
     number = {10},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2009_10_a48/}
}
TY  - JOUR
AU  - I. A. Badeha
AU  - P. V. Roldugin
TI  - Some properties of graph edge clique coverings
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2009
SP  - 95
EP  - 96
IS  - 10
UR  - http://geodesic.mathdoc.fr/item/PDM_2009_10_a48/
LA  - ru
ID  - PDM_2009_10_a48
ER  - 
%0 Journal Article
%A I. A. Badeha
%A P. V. Roldugin
%T Some properties of graph edge clique coverings
%J Prikladnaâ diskretnaâ matematika
%D 2009
%P 95-96
%N 10
%U http://geodesic.mathdoc.fr/item/PDM_2009_10_a48/
%G ru
%F PDM_2009_10_a48
I. A. Badeha; P. V. Roldugin. Some properties of graph edge clique coverings. Prikladnaâ diskretnaâ matematika, no. 10 (2009), pp. 95-96. http://geodesic.mathdoc.fr/item/PDM_2009_10_a48/

[1] Orlin J., “Contentment in graph theory: Covering graphs with cliques”, Indagationes Math., 39 (1977), 406–424 | DOI | MR