Zobrazeno 1 - 10
of 10
pro vyhledávání: '"D. B. Mokeev"'
Autor:
D. B. Mokeev, Dmitry S. Malyshev
Publikováno v:
Optimization Letters. 16:481-496
We consider graphs, which and all induced subgraphs of which possess the following property: the maximum number of disjoint paths on k vertices equals the minimum cardinality of vertex sets, covering all paths on k vertices. We call such graphs Konig
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::04d949df7e62a791d7fce3d495e8418c
https://doi.org/10.1007/s11590-021-01771-8
https://doi.org/10.1007/s11590-021-01771-8
Publikováno v:
Journal of Applied and Industrial Mathematics. 14:480-489
We consider the problem of minimizing the number of colors in the colorings of the vertices of a given graph so that, to each vertex there is assigned some set of colors whose number is equal to the given weight of the vertex; and adjacent vertices r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::23436c511a58dcb44dbfaa8beaf426a8
https://doi.org/10.1134/s1990478920030072
https://doi.org/10.1134/s1990478920030072
Autor:
D. B. Mokeev, Dmitriy S. Malyshev
Publikováno v:
Journal of Applied and Industrial Mathematics. 14:369-384
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 ve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::124cbdadbaa057bdf3a7c3e680c13870
https://doi.org/10.1134/s1990478920020143
https://doi.org/10.1134/s1990478920020143
Autor:
Dmitriy S. Malyshev, D. B. Mokeev
Publikováno v:
Optimization Letters. 14:1317-1322
For a graph G and a positive integer k, a subset C of vertices of G is called a k-path vertex cover if C intersects all paths of k vertices in G. The cardinality of a minimum k-path vertex cover is denoted by $$\beta _{P_k}(G)$$ . For a graph G and a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ce8c915f60cc552064dd8d2ac76e9413
https://doi.org/10.1007/s11590-019-01475-0
https://doi.org/10.1007/s11590-019-01475-0
Autor:
Dmitriy S. Malyshev, D. B. Mokeev
Publikováno v:
Journal of Applied and Industrial Mathematics. 13:85-92
We describe the class of graphs whose every subgraph has the next property: The maximal number of disjoint 4-paths is equal to the minimal cardinality of sets of vertices such that every 4-path in the subgraph contains at least one of these vertices.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bab5caca0a0db2d31f1ab7a174df51cc
https://doi.org/10.1134/s1990478919010101
https://doi.org/10.1134/s1990478919010101
Autor:
D. B. Mokeev
Publikováno v:
Journal of Applied and Industrial Mathematics. 11:421-430
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2ce21966edb760e5472484bb6cb40762
https://doi.org/10.1134/s1990478917030139
https://doi.org/10.1134/s1990478917030139
Autor:
Vladimir E. Alekseev, D. B. Mokeev
Publikováno v:
Discrete Applied Mathematics. 204:1-5
Given a set X , a Konig graph G for X is a graph with the following property: for every induced subgraph H of G , the maximum number of vertex-disjoint induced subgraphs from X in H is equal to the minimum number of vertices whose deletion from H res
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4bf3393958f98bef990a4000e19d9299
https://doi.org/10.1016/j.dam.2015.10.002
https://doi.org/10.1016/j.dam.2015.10.002
Autor:
D. B. Mokeev
Publikováno v:
Springer Proceedings in Mathematics & Statistics ISBN: 9783319962467
A triangle packing of graph G is a set of pairwise vertex-disjoint 3-vertex cycles in G. A triangle vertex cover of graph G is a subset S of vertices of G such that every cycle of 3 vertices in G contains at least one vertex from S. We consider a her
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::465b268951071de94c3f6e03682ad86e
https://doi.org/10.1007/978-3-319-96247-4_4
https://doi.org/10.1007/978-3-319-96247-4_4
Autor:
D. B. Mokeev
Publikováno v:
Models, Algorithms and Technologies for Network Analysis ISBN: 9783319296067
We characterize the graphs whose induced subgraphs all have the following property: The maximum number of induced 4-paths is equal to the minimum cardinality of the set of vertices such that every induced 4-path contains at least one of them. In this
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::87ed1c0f6eb909294ce279a18b88d1df
https://doi.org/10.1007/978-3-319-29608-1_3
https://doi.org/10.1007/978-3-319-29608-1_3
Autor:
D. B. Mokeev
Publikováno v:
Models, Algorithms and Technologies for Network Analysis ISBN: 9783319097572
We give characterization of the graphs, whose each induced subgraph has the property: the maximum number of induced 4-paths is equal to the minimum cardinality of the set of vertices such as every induced 4-path contains at least one of them.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ee577bbc90cd17a4f22e2f6092028a41
https://doi.org/10.1007/978-3-319-09758-9_8
https://doi.org/10.1007/978-3-319-09758-9_8