Prikladnaya Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Prikl. Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




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

Prikladnaya Diskretnaya Matematika, 2013, Number 1(19), Pages 69–83 (Mi pdm393)  
Applied Graph Theory

Edge clique coverings of graphs

I. A. Badekha

Russian State Social University, Moscow
Full-text PDF (895 kB)
References:
PDF
HTML
Abstract: 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, graph isomorphism, $NP$-complete problems.
Document Type: Article
UDC: 519.1
Language: Russian
Citation: I. A. Badekha, “Edge clique coverings of graphs”, Prikl. Diskr. Mat., 2013, no. 1(19), 69–83
Citation in format AMSBIB
\Bibitem{Bad13}
\by I.~A.~Badekha
\paper Edge clique coverings of graphs
\jour Prikl. Diskr. Mat.
\yr 2013
\issue 1(19)
\pages 69--83
\mathnet{http://mi.mathnet.ru/pdm393}
Linking options:
  • https://www.mathnet.ru/eng/pdm393
  • https://www.mathnet.ru/eng/pdm/y2013/i1/p69
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Прикладная дискретная математика
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024