König graphs with respect to the 4-path and its spanning supergraphs
From MaRDI portal
Publication:4973244
DOI10.1134/S1990478919010101zbMATH Open1438.05143MaRDI QIDQ4973244FDOQ4973244
Authors: D. S. Malyshev, D. B. Mokeev 
Publication date: 2 December 2019
Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)
Recommendations
Cites Work
- Paths, Trees, and Flowers
- Independence numbers of graphs - an extension of the Koenig-Egervary theorem
- Packing cycles in graphs. II
- Minimum \(k\)-path vertex cover
- König graphs for 3-paths and 3-cycles
- A 2-approximation algorithm for the vertex cover \(P_{4}\) problem in cubic graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the completeness of a generalized matching problem
- On computing the minimum 3-path vertex cover and dissociation number of graphs
- A primal-dual approximation algorithm for the vertex cover \(P^3\) problem
- Graph packings
- The impact of the growth rate of the packing number of graphs on the computational complexity of the independent set problem
- A characterization of the graphs in which the transversal number equals the matching number
- Combinatorial and computational aspects of graph packing and graph decomposition
- Computational complexity of minimum \(P_4\) vertex cover problem for regular and \(K_{1, 4}\)-free graphs
- Chain packing in graphs
- Tighter bounds on the size of a maximum \(P_{3}\)-matching in a cubic graph
- On König graphs with respect to \(P_4\)
Cited In (4)
This page was built for publication: König graphs with respect to the 4-path and its spanning supergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4973244)
