Geodesic
Finding Large Clique Minors is Hard
Journal of Graph Algorithms and Applications, Tome 13 (2009) no. 2, pp. 197-204.

Voir la notice de l'article provenant de la source Journal of Graph Algorythms and Applications website

We prove that it is NP-complete, given a graph G and a parameter h, to determine whether G contains a complete graph Kh as a minor.
DOI : 10.7155/jgaa.00183
Keywords: Graph minor, Hadwiger number, Clique, NP-complete 
@article{JGAA_2009_13_2_a6,
     author = {David Eppstein},
     title = {Finding {Large} {Clique} {Minors} is {Hard}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {197--204},
     publisher = {mathdoc},
     volume = {13},
     number = {2},
     year = {2009},
     doi = {10.7155/jgaa.00183},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00183/}
}
TY  - JOUR
AU  - David Eppstein
TI  - Finding Large Clique Minors is Hard
JO  - Journal of Graph Algorithms and Applications
PY  - 2009
SP  - 197
EP  - 204
VL  - 13
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00183/
DO  - 10.7155/jgaa.00183
LA  - en
ID  - JGAA_2009_13_2_a6
ER  - 
%0 Journal Article
%A David Eppstein
%T Finding Large Clique Minors is Hard
%J Journal of Graph Algorithms and Applications
%D 2009
%P 197-204
%V 13
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00183/
%R 10.7155/jgaa.00183
%G en
%F JGAA_2009_13_2_a6
David Eppstein. Finding Large Clique Minors is Hard. Journal of Graph Algorithms and Applications, Tome 13 (2009) no. 2, pp. 197-204. doi : 10.7155/jgaa.00183. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00183/

Cité par Sources :