- Find a NP-Complete graph theory problem and have it approved by Dymacek.
- Find an article which proves your problem is NP-Complete.
- Find an article which uses your problem to prove another problem is NP-Complete.
- Find an application which uses your problem.
- Create a 10 minute presentation which teaches how the problem is NP-Complete and explains why this problem relates to us (application).

Department of Mathematics & Computer Science

Cook-Cole College of Arts & Sciences

Longwood University