Proof of minimal colour in vertex colouring problem
- From: Joojle <jjlowing@xxxxxxxxx>
- Date: Wed, 30 Jan 2008 10:00:37 -0800 (PST)
I am doing a research about Graph colouring problem. As I known this
problem is in NP-Complete, so I want to find the proof that show this
problem is np-complete by show it is NP and it has reduce problem in
NP problem as the definition said.
Any suggestions are welcome where to find it or guideline to let me
proof by myself
Thank you
.
- Prev by Date: LIVE PROJECTS FOR FINAL YEAR STUDENTS FOR B.E(CSE/ISE/ECE)/M.Tech/BCA/MCA/M.SC/B.SC
- Previous by thread: LIVE PROJECTS FOR FINAL YEAR STUDENTS FOR B.E(CSE/ISE/ECE)/M.Tech/BCA/MCA/M.SC/B.SC
- Index(es):
