Geodesic
About relationship between parameters of certain graphs
Prikladnaâ diskretnaâ matematika, no. 12 (2010), pp. 94-95.

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

Now certain graphs are under attention, which have no trivial possibility to be reduced for constructing easily the edge clique cover. These graphs have some interesting features allowing to state a relationship between different parameters of such graphs. In the work some rules are formulated for constructing graphs with different relationships between the parameters from other graphs meeting the same conditions. Due to these rules, the graphs with any relationship between the parameters can be constructed. 
@article{PDM_2010_12_a47,
     author = {I. A. Badeha and P. V. Roldugin},
     title = {About relationship between parameters of certain graphs},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {94--95},
     publisher = {mathdoc},
     number = {12},
     year = {2010},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2010_12_a47/}
}
TY  - JOUR
AU  - I. A. Badeha
AU  - P. V. Roldugin
TI  - About relationship between parameters of certain graphs
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2010
SP  - 94
EP  - 95
IS  - 12
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2010_12_a47/
LA  - ru
ID  - PDM_2010_12_a47
ER  - 
%0 Journal Article
%A I. A. Badeha
%A P. V. Roldugin
%T About relationship between parameters of certain graphs
%J Prikladnaâ diskretnaâ matematika
%D 2010
%P 94-95
%N 12
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2010_12_a47/
%G ru
%F PDM_2010_12_a47
I. A. Badeha; P. V. Roldugin. About relationship between parameters of certain graphs. Prikladnaâ diskretnaâ matematika, no. 12 (2010), pp. 94-95. http://geodesic.mathdoc.fr/item/PDM_2010_12_a47/

[1] Cavers M. S., Clique partitions and coverings of graphs, University of Waterloo, 2005

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

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