Finding Large Clique Minors is Hard

Details Finding Large Clique Minors is Hard Finding Large Clique Minors is Hard

2008-06-30

arxiv.org/abs/0807.0007v2

J. Graph Algorithms and Applications 13(2):197-204, 2009

Computer Science

Discrete Mathematics

5 pages, 1 figure

Scientific paper

We prove that it is NP-complete, given a graph G and a parameter h, to
determine whether G contains a complete graph K_h as a minor.

Affiliated with

Also associated with

No associations

Rating

Finding Large Clique Minors is Hard does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Finding Large Clique Minors is Hard, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finding Large Clique Minors is Hard will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-80069