Geodesic
Edge clique coverings of graphs
Prikladnaâ diskretnaâ matematika, no. 1 (2013), pp. 69-83.

Voir la notice de l'article provenant de la source Math-Net.Ru

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.
Keywords: graphs, edge clique covering, $NP$-complete problems.
Mots-clés : graph isomorphism 
@article{PDM_2013_1_a5,
     author = {I. A. Badekha},
     title = {Edge clique coverings of graphs},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {69--83},
     publisher = {mathdoc},
     number = {1},
     year = {2013},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2013_1_a5/}
}
TY  - JOUR
AU  - I. A. Badekha
TI  - Edge clique coverings of graphs
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2013
SP  - 69
EP  - 83
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2013_1_a5/
LA  - ru
ID  - PDM_2013_1_a5
ER  - 
%0 Journal Article
%A I. A. Badekha
%T Edge clique coverings of graphs
%J Prikladnaâ diskretnaâ matematika
%D 2013
%P 69-83
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2013_1_a5/
%G ru
%F PDM_2013_1_a5
I. A. Badekha. Edge clique coverings of graphs. Prikladnaâ diskretnaâ matematika, no. 1 (2013), pp. 69-83. http://geodesic.mathdoc.fr/item/PDM_2013_1_a5/

[1] Kou L. T., Stockmeyer L. J., Wong C. K., “Cliques with regard to keyword conflicts and intersection graphs”, Comm. ACM, 21:2 (1978), 135–139 | DOI | MR | Zbl

[2] Orlin J., “Contentment in graph theory: covering graphs with cliques”, Indagat. Math., 80:2 (1977), 406–424 | DOI | MR | Zbl

[3] Gramm J., Guo J., Huffner F., Niedermeier R., “Data reduction, exact, and heuristic algorithms for clique cover”, Proc. 8th Workshop on Algorithm Engineering and Experiments (Miami, Fl., January 21, 2006), 86–94

[4] Cavers M. S., Clique partitions and coverings of graphs, Masters thesis, University of Waterloo, 2005 http://www.math.uwaterloo.ca/co/graduate-students/files/mmath/Mike-Cavers.pdf

[5] Kharari F., Teoriya grafov, Mir, M., 1973, 301 pp.