Pages that link to "Item:Q2341756"
From MaRDI portal
The following pages link to Computational complexity of minimum \(P_4\) vertex cover problem for regular and \(K_{1, 4}\)-free graphs (Q2341756):
Displayed 8 items.
- Improved approximation algorithms for path vertex covers in regular graphs (Q2006949) (← links)
- Approximation algorithms for minimum weight connected 3-path vertex cover (Q2008557) (← links)
- On partial descriptions of König graphs for odd paths and all their spanning supergraphs (Q2115309) (← links)
- Kernels for packing and covering problems (Q2272393) (← links)
- König Graphs with Respect to the 4-Path and Its Spanning Supergraphs (Q4973244) (← links)
- On the König graphs for a 5-path and its spanning supergraphs (Q5090154) (← links)
- Approximating Bounded Degree Deletion via Matroid Matching (Q5283370) (← links)
- Analyzing the 3-path vertex cover problem in planar bipartite graphs (Q6111949) (← links)