|
This article is cited in 3 scientific papers (total in 3 papers)
König graphs with respect to the 4-path and its spanning supergraphs
D. S. Malysheva, D. B. Mokeevba a National Research University “Higher School of Economics”,
25/12 Bolshaya Pechyorskaya Street, 603155 Nizhny Novgorod, Russia
b Lobachevsky Nizhny Novgorod State University, 23 Gagarin Avenue, 603950 Nizhny Novgorod, Russia
Abstract:
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. We completely describe the set of minimal forbidden subgraphs for this class. Moreover, we present an alternative description of the class based on the operations of edge subdivision applied to bipartite multigraphs and the addition of the so-called pendant subgraphs, isomorphic to triangles and stars. Illustr. 1, bibliogr. 19.
Keywords:
subgraph packing, vertex cover of a subgraph, 4-path, König graph.
Received: 12.12.2017 Revised: 30.10.2018 Accepted: 28.11.2018
Citation:
D. S. Malyshev, D. B. Mokeev, “König graphs with respect to the 4-path and its spanning supergraphs”, Diskretn. Anal. Issled. Oper., 26:1 (2019), 74–88; J. Appl. Industr. Math., 13:1 (2019), 85–92
Linking options:
https://www.mathnet.ru/eng/da918 https://www.mathnet.ru/eng/da/v26/i1/p74
|
Statistics & downloads: |
Abstract page: | 300 | Full-text PDF : | 57 | References: | 34 | First page: | 11 |
|