Topic: Complexity of Graph Problems

What NP-Completeness Says About Approximation

Vertex Cover and Independent Set

The Hamiltonian Cycle Decision Problem

Reduction Direction and Gadget-Verification Pitfalls

Reducing 3-SAT to Clique

Polynomial-Time Many-One Reductions

Polynomial Time and Class P

NP-Hardness and NP-Completeness

Independent Set Through Graph Complements

Greedy Independent Sets and Degree Guarantees