|
This article is cited in 1 scientific paper (total in 1 paper)
On the König graphs for a 5-path and its spanning supergraphs
D. B. Mokeevab, D. S. Malyshevb a Lobachevsky State University of Nizhny Novgorod, 23 Gagarin Avenue, 603950 N. Novgorod, Russia
b National Research University “Higher School of Economics”, 25/12 Bolshaya Pechyorskaya Street, 603155 Nizhny Novgorod, Russia
Abstract:
We describe the hereditary class of graphs whose every subgraph has the property that the maximum number of disjoint 5-paths (paths on 5 vertices) is equal to the minimum size of the sets of vertices having nonempty intersection with the vertex set of each 5-path. We describe this class in terms of the “forbidden subgraphs” and give an alternative description, using some operations on pseudographs. Illustr. 2, bibliogr. 18.
Keywords:
subgraph packing, vertex cover, five-vertex path, König graph.
Received: 13.11.2018 Revised: 31.01.2020 Accepted: 19.02.2020
Citation:
D. B. Mokeev, D. S. Malyshev, “On the König graphs for a 5-path and its spanning supergraphs”, Diskretn. Anal. Issled. Oper., 27:2 (2020), 90–116; J. Appl. Industr. Math., 14:2 (2020), 367–382
Linking options:
https://www.mathnet.ru/eng/da952 https://www.mathnet.ru/eng/da/v27/i2/p90
|
Statistics & downloads: |
Abstract page: | 256 | Full-text PDF : | 87 | References: | 34 | First page: | 4 |
|