Pages that link to "Item:Q1735245"
From MaRDI portal
The following pages link to Complexity and algorithms for the connected vertex cover problem in 4-regular graphs (Q1735245):
Displaying 9 items.
- An efficient heuristic algorithm for solving connected vertex cover problem (Q1720833) (← links)
- Hitting subgraphs in \(P_4\)-tidy graphs (Q2010691) (← links)
- Complexity and computation of connected zero forcing (Q2012050) (← links)
- Set-weighted games and their application to the cover problem (Q2083971) (← links)
- Layered graphs: applications and algorithms (Q2287476) (← links)
- Nonseparating independent sets of Cartesian product graphs (Q2300678) (← links)
- Connected power domination in graphs (Q2424811) (← links)
- The connected vertex cover problem in \(k\)-regular graphs (Q2424831) (← links)
- Connected vertex cover for \((sP_1+P_5)\)-free graphs (Q5919305) (← links)
