On the König graphs for a 5-path and its spanning supergraphs
From MaRDI portal
Publication:5090154
DOI10.33048/daio.2020.27.639zbMath1493.05250OpenAlexW3033577684MaRDI QIDQ5090154
Dmitrii Mokeev, Dmitriy S. Malyshev
Publication date: 15 July 2022
Published in: Diskretnyi analiz i issledovanie operatsii (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/da952
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- König graphs for 3-paths and 3-cycles
- A characterization of the graphs in which the transversal number equals the matching number
- 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
- Chain packing in graphs
- Tighter bounds on the size of a maximum \(P_{3}\)-matching in a cubic graph
- Independence numbers of graphs - an extension of the Koenig-Egervary theorem
- Minimum \(k\)-path vertex cover
- Computational complexity of minimum \(P_4\) vertex cover problem for regular and \(K_{1, 4}\)-free graphs
- A 2-approximation algorithm for the vertex coverP4problem in cubic graphs
- König Graphs with Respect to the 4-Path and Its Spanning Supergraphs
- Paths, Trees, and Flowers
- On König graphs with respect to P4
- On the completeness of a generalized matching problem
This page was built for publication: On the König graphs for a 5-path and its spanning supergraphs
