NP-completeness of the planar separator problems.
Fukuyama, Junichiro
Journal of Graph Algorithms and Applications, Tome 10 (2006), p. 317-328 / Harvested from The Electronic Library of Mathematics
Full (PDF)
Publié le : 2006-01-01
EUDML-ID : urn:eudml:doc:45389 
@article{05493566,
     title = {NP-completeness of the planar separator problems.},
     journal = {Journal of Graph Algorithms and Applications},
     volume = {10},
     year = {2006},
     pages = {317-328},
     zbl = {1178.68378},
     language = {en},
     url = {http://dml.mathdoc.fr/item/05493566}
}

Fukuyama, Junichiro. NP-completeness of the planar separator problems.. Journal of Graph Algorithms and Applications, Tome 10 (2006) pp. 317-328. http://gdmltest.u-ga.fr/item/05493566/