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, 2017, Volume 24, Issue 3, Pages 61–79
DOI: https://doi.org/10.17377/daio.2017.24.561 (Mi da875) 		 
This article is cited in 4 scientific papers (total in 4 papers)

On König graphs with respect to $P_4$

D. B. Mokeevab

a Lobachevsky Nizhny Novgorod State University, 23 Gagarin Ave., 603950 Nizhny Novgorod, Russia
b Higher School of Economics in Nizhny Novgorod, 25/12 Bolshaya Pechyorskaya St., 603155 Nizhny Novgorod, Russia
Full-text PDF (340 kB) Citations (4)
References:
PDF
HTML
DOI: https://doi.org/10.17377/daio.2017.24.561
Abstract: We describe the class of graphs whose every induced subgraph has the property: The maximum number of disjoint induced $4$-paths is equal to the minimum size of the set of the vertices such that each $4$-path contains at least one of them. The description is based on the operation of replacing vertices by cographs which is to the vertices of the graphs obtained from bipartite graphs by subdividing their cycle edges. Bibliogr. 13.
Keywords: packing of subgraphs, vertex covering of subgraphs, $4$-path, König graph.
Funding agency Grant number
Russian Foundation for Basic Research 16-31-00109_мол_а
16-01-00599_а
17-01-00710_а
Ministry of Education and Science of the Russian Federation МК-4819.2016.1
11.G34.31.0057
Received: 30.12.2016
Revised: 24.01.2017
English version:
Journal of Applied and Industrial Mathematics, 2017, Volume 11, Issue 3, Pages 421–430
DOI: https://doi.org/10.1134/S1990478917030139
Bibliographic databases:
Document Type: Article
UDC: 519.174.3
Language: Russian
Citation: D. B. Mokeev, “On König graphs with respect to $P_4$”, Diskretn. Anal. Issled. Oper., 24:3 (2017), 61–79; J. Appl. Industr. Math., 11:3 (2017), 421–430
Citation in format AMSBIB
\Bibitem{Mok17}
\by D.~B.~Mokeev
\paper On K\"onig graphs with respect to~$P_4$
\jour Diskretn. Anal. Issled. Oper.
\yr 2017
\vol 24
\issue 3
\pages 61--79
\mathnet{http://mi.mathnet.ru/da875}
\crossref{https://doi.org/10.17377/daio.2017.24.561}
\elib{https://elibrary.ru/item.asp?id=29869483}
\transl
\jour J. Appl. Industr. Math.
\yr 2017
\vol 11
\issue 3
\pages 421--430
\crossref{https://doi.org/10.1134/S1990478917030139}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85028545763}
Linking options:
  • https://www.mathnet.ru/eng/da875
  • https://www.mathnet.ru/eng/da/v24/i3/p61
    • This publication is cited in the following 4 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:248
    Full-text PDF :84
    References:41
    First page:6
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024