Pages that link to "Item:Q1123898"
From MaRDI portal
The following pages link to On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three (Q1123898):
Displayed 9 items.
- On the maximum induced forests of a connected cubic graph without triangles (Q757394) (← links)
- Minimum weakly fundamental cycle bases are hard to find (Q1024786) (← links)
- Vertex and edge covers with clustering properties: Complexity and algorithms (Q1026225) (← links)
- Maximum genus and maximum nonseparating independent set of a 3-regular graph (Q1377685) (← links)
- Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs (Q2266936) (← links)
- Dominating and large induced trees in regular graphs (Q2463903) (← links)
- On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem (Q2773025) (← links)
- Complexity and Approximation Results for the Connected Vertex Cover Problem (Q3508568) (← links)
- (Q5708559) (← links)