Geodesic
On biclique covering number of the Cartesian product of graphs
Trudy Instituta matematiki, Tome 21 (2013) no. 1, pp. 78-87

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

The paper is dealt with the biclique cover number (i.e. minimal number of complete bipartite subgraphs of a graph needed to cover the edge set of the graph) of the Cartesian product of two graphs. It is obtained upper bounds on the biclique cover number for the Cartesian product of graphs. It is given the formula for exact value of the biclique cover number for the Cartesian product of $P_n$ and $K_2$, $C_n$ and $K_2$, $P_n$ and $P_n$. 
@article{TIMB_2013_21_1_a9,
     author = {V. V. Lepin and O. I. Duginov},
     title = {On biclique covering number of the {Cartesian} product of graphs},
     journal = {Trudy Instituta matematiki},
     pages = {78--87},
     publisher = {mathdoc},
     volume = {21},
     number = {1},
     year = {2013},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/TIMB_2013_21_1_a9/}
}
TY  - JOUR
AU  - V. V. Lepin
AU  - O. I. Duginov
TI  - On biclique covering number of the Cartesian product of graphs
JO  - Trudy Instituta matematiki
PY  - 2013
SP  - 78
EP  - 87
VL  - 21
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/TIMB_2013_21_1_a9/
LA  - ru
ID  - TIMB_2013_21_1_a9
ER  - 
%0 Journal Article
%A V. V. Lepin
%A O. I. Duginov
%T On biclique covering number of the Cartesian product of graphs
%J Trudy Instituta matematiki
%D 2013
%P 78-87
%V 21
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/TIMB_2013_21_1_a9/
%G ru
%F TIMB_2013_21_1_a9
V. V. Lepin; O. I. Duginov. On biclique covering number of the Cartesian product of graphs. Trudy Instituta matematiki, Tome 21 (2013) no. 1, pp. 78-87. http://geodesic.mathdoc.fr/item/TIMB_2013_21_1_a9/