Prikladnaya Diskretnaya Matematika. Supplement
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


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




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

Prikladnaya Diskretnaya Matematika. Supplement, 2012, Issue 5, Page 95 (Mi pdma37)  
Applied graph theory

Matchings construction procedure

T. A. Magomedov

Daghestan State University, Makhachkala
Full-text PDF (401 kB)
References:
PDF
HTML
Abstract: Conditions for the existence of consecutive matchings in a bipartite graph are considered.
Document Type: Article
UDC: 519.1
Language: Russian
Citation: T. A. Magomedov, “Matchings construction procedure”, Prikl. Diskr. Mat. Suppl., 2012, no. 5, 95
Citation in format AMSBIB
\Bibitem{Mag12}
\by T.~A.~Magomedov
\paper Matchings construction procedure
\jour Prikl. Diskr. Mat. Suppl.
\yr 2012
\issue 5
\pages 95
\mathnet{http://mi.mathnet.ru/pdma37}
Linking options:
  • https://www.mathnet.ru/eng/pdma37
  • https://www.mathnet.ru/eng/pdma/y2012/i5/p95
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Prikladnaya Diskretnaya Matematika. Supplement
    Statistics & downloads:
    Abstract page:94
    Full-text PDF :52
    References:34
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024