Trudy Instituta Matematiki
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Proceedings of the Institute of Mathematics of the NAS of Belarus:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Trudy Instituta Matematiki, 2013, Volume 21, Number 1, Pages 78–87 (Mi timb188)  
This article is cited in 1 scientific paper (total in 1 paper)

On biclique covering number of the Cartesian product of graphs

V. V. Lepin, O. I. Duginov

Institute of Mathematics of the National Academy of Sciences of Belarus
Full-text PDF (380 kB) Citations (1)
References:
PDF
HTML
Abstract: 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$.
Received: 10.01.2013
Document Type: Article
UDC: 519.1
Language: Russian
Citation: V. V. Lepin, O. I. Duginov, “On biclique covering number of the Cartesian product of graphs”, Tr. Inst. Mat., 21:1 (2013), 78–87
Citation in format AMSBIB
\Bibitem{LepDug13}
\by V.~V.~Lepin, O.~I.~Duginov
\paper On biclique covering number of the Cartesian product of graphs
\jour Tr. Inst. Mat.
\yr 2013
\vol 21
\issue 1
\pages 78--87
\mathnet{http://mi.mathnet.ru/timb188}
Linking options:
  • https://www.mathnet.ru/eng/timb188
  • https://www.mathnet.ru/eng/timb/v21/i1/p78
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Труды Института математики
    Statistics & downloads:
    Abstract page:322
    Full-text PDF :269
    References:36
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024