Pages that link to "Item:Q2481963"

The following pages link to The computational complexity of the parallel knock-out problem (Q2481963):

Displaying 3 items.

• Path factors and parallel knock-out schemes of almost claw-free graphs (Q968408) (← links)
• Upper bounds and algorithms for parallel knock-out numbers (Q1008728) (← links)
• Knocking out \(P_k\)-free graphs (Q2352787) (← links)