Meždunarodnyj naučno-issledovatel'skij žurnal
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


Meždunar. nauč.-issled. žurn.:
Year:
Volume:
Issue:
Page:
Find




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

Meždunarodnyj naučno-issledovatel'skij žurnal, 2014, , Issue 3(22), Pages 11–12 (Mi irj381)  
PHYSICS AND MATHEMATICS

Reduction enumeration of bipartite graphs

A. M. Magomedov

Dagestan state University
Full-text PDF (439 kB)
References:
PDF
HTML
Abstract: The article consideres method of elimination enumeration of nonisomorphic biregular graphs generated by a small set of vertices.
Keywords: coloring, isomorphism, graph.
Document Type: Article
Language: Russian
Citation: A. M. Magomedov, “Reduction enumeration of bipartite graphs”, Meždunar. nauč.-issled. žurn., 2014, no. 3(22), 11–12
Citation in format AMSBIB
\Bibitem{Mag14}
\by A.~M.~Magomedov
\paper Reduction enumeration of bipartite graphs
\jour Me{\v z}dunar. nau{\v{c}}.-issled. {\v z}urn.
\yr 2014
\issue 3(22)
\pages 11--12
\mathnet{http://mi.mathnet.ru/irj381}
Linking options:
  • https://www.mathnet.ru/eng/irj381
  • https://www.mathnet.ru/eng/irj/v22/i3/p11
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Meždunarodnyj naučno-issledovatel'skij žurnal
    Statistics & downloads:
    Abstract page:63
    Full-text PDF :22
    References:19
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024