Мақаланы E-mail арқылы жіберу On König graphs with respect to P4
- Авторлар: Mokeev D.B.1,2
-
Мекемелер:
- Lobachevsky Nizhny Novgorod State University
- National Research University Higher School of Economics
- Шығарылым: Том 11, № 3 (2017)
- Беттер: 421-430
- Бөлім: Article
- URL: https://journals.rcsi.science/1990-4789/article/view/212814
- DOI: https://doi.org/10.1134/S1990478917030139
- ID: 212814
Дәйексөз келтіру
Ашық рұқсат
Рұқсат берілді
Тек жазылушылар үшін
Аннотация
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.
Негізгі сөздер
Авторлар туралы
D. Mokeev
Lobachevsky Nizhny Novgorod State University; National Research University Higher School of Economics
Хат алмасуға жауапты Автор.
Email: MokeevDB@gmail.com
Ресей, pr. Gagarina 23, Nizhny Novgorod, 603950; ul. Bol’shaya Pecherskaya 25/12, Nizhny Novgorod, 603155
Қосымша файлдар
