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, 2010, Number 3(9), Pages 96–99 (Mi pdm237)  

Applied Graph Theory

A family of exact 2-extensions of tournaments

A. A. Dolgov

Saratov State University named after N. G. Chernyshevsky, Saratov
References:
Abstract: The family of tournaments which have exact 1- and 2-extensions but haven't exact 3-extension is introduced. It is the only known family of graphs with such a property, and it is the fourth family of graphs which have exact $k$-extension for $k>1$.
Keywords: graph, exact $k$-extension, circulant.
Document Type: Article
UDC: 519.17
Language: Russian
Citation: A. A. Dolgov, “A family of exact 2-extensions of tournaments”, Prikl. Diskr. Mat., 2010, no. 3(9), 96–99
Citation in format AMSBIB
\Bibitem{Dol10}
\by A.~A.~Dolgov
\paper A family of exact 2-extensions of tournaments
\jour Prikl. Diskr. Mat.
\yr 2010
\issue 3(9)
\pages 96--99
\mathnet{http://mi.mathnet.ru/pdm237}
Linking options:
  • https://www.mathnet.ru/eng/pdm237
  • https://www.mathnet.ru/eng/pdm/y2010/i3/p96
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Прикладная дискретная математика
    Statistics & downloads:
    Abstract page:139
    Full-text PDF :53
    References:40
    First page:1
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024