Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find




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

Diskretnyi Analiz i Issledovanie Operatsii, 2012, Volume 19, Issue 4, Pages 3–14 (Mi da693)  
This article is cited in 6 scientific papers (total in 6 papers)

König graphs with respect to $3$-paths

V. E. Alekseeva, D. B. Mokeevab

a Nizhny Novgorod State University, Nizhny Novgorod, Russia
b National Research University «High school of economics», Nizhny Novgorod, Russia
Full-text PDF (254 kB) Citations (6)
References:
PDF
HTML
Abstract: We characterize the graphs whose each induced subgraph has the property: the packing number of induced $3$-paths is equal to the corresponding vertex cover number. Ill. 2, bibliogr. 4.
Keywords: subgraph packing, subgraph vertex covering, König graph, $3$-path, forbidden subgraph.
Received: 19.09.2011
Revised: 08.02.2012
Bibliographic databases:
Document Type: Article
UDC: 519.174.3
Language: Russian
Citation: V. E. Alekseev, D. B. Mokeev, “König graphs with respect to $3$-paths”, Diskretn. Anal. Issled. Oper., 19:4 (2012), 3–14
Citation in format AMSBIB
\Bibitem{AleMok12}
\by V.~E.~Alekseev, D.~B.~Mokeev
\paper K\"onig graphs with respect to $3$-paths
\jour Diskretn. Anal. Issled. Oper.
\yr 2012
\vol 19
\issue 4
\pages 3--14
\mathnet{http://mi.mathnet.ru/da693}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3013539}
Linking options:
  • https://www.mathnet.ru/eng/da693
  • https://www.mathnet.ru/eng/da/v19/i4/p3
    • This publication is cited in the following 6 articles:
    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