Geodesic
On the K\"onig graphs for a 5-path and~its~spanning~supergraphs
Diskretnyj analiz i issledovanie operacij, Tome 27 (2020) no. 2, pp. 90-116

Voir la notice de l'article provenant de la source Math-Net.Ru

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. 
@article{DA_2020_27_2_a4,
     author = {D. B. Mokeev and D. S. Malyshev},
     title = {On the {K\"onig} graphs for a 5-path and~its~spanning~supergraphs},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {90--116},
     publisher = {mathdoc},
     volume = {27},
     number = {2},
     year = {2020},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2020_27_2_a4/}
}
TY  - JOUR
AU  - D. B. Mokeev
AU  - D. S. Malyshev
TI  - On the K\"onig graphs for a 5-path and~its~spanning~supergraphs
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2020
SP  - 90
EP  - 116
VL  - 27
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2020_27_2_a4/
LA  - ru
ID  - DA_2020_27_2_a4
ER  - 
%0 Journal Article
%A D. B. Mokeev
%A D. S. Malyshev
%T On the K\"onig graphs for a 5-path and~its~spanning~supergraphs
%J Diskretnyj analiz i issledovanie operacij
%D 2020
%P 90-116
%V 27
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2020_27_2_a4/
%G ru
%F DA_2020_27_2_a4
D. B. Mokeev; D. S. Malyshev. On the K\"onig graphs for a 5-path and~its~spanning~supergraphs. Diskretnyj analiz i issledovanie operacij, Tome 27 (2020) no. 2, pp. 90-116. http://geodesic.mathdoc.fr/item/DA_2020_27_2_a4/