Pages that link to "Item:Q1735245"

The following pages link to Complexity and algorithms for the connected vertex cover problem in 4-regular graphs (Q1735245):

Displaying 13 items.

• Improved algorithms for graph four-connectivity (Q808289) (← links)
• An efficient heuristic algorithm for solving connected vertex cover problem (Q1720833) (← links)
• Improved approximation algorithms for path vertex covers in regular graphs (Q2006949) (← 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)
• Computational complexity of minimum \(P_4\) vertex cover problem for regular and \(K_{1, 4}\)-free graphs (Q2341756) (← links)
• Connected power domination in graphs (Q2424811) (← links)
• The connected vertex cover problem in \(k\)-regular graphs (Q2424831) (← links)
• (Q4489799) (← links)
• Connected vertex cover for \((sP_1+P_5)\)-free graphs (Q5919305) (← links)