k-colored point-set embeddability of outerplanar graphs.
Di Giacomo, Emilio ; Didimo, Walter ; Liotta, Giuseppe ; Meijer, Henk ; Trotta, Francesco ; Wismath, Stephen K.
Journal of Graph Algorithms and Applications, Tome 12 (2008), p. 29-49 / Harvested from The Electronic Library of Mathematics
Full (PDF)
Publié le : 2008-01-01
EUDML-ID : urn:eudml:doc:55404 
@article{05493594,
     title = {<title-group xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"><article-title xml:lang="en"><math><mi>k</mi></math>-colored point-set embeddability of outerplanar graphs.</article-title></title-group>},
     journal = {Journal of Graph Algorithms and Applications},
     volume = {12},
     year = {2008},
     pages = {29-49},
     zbl = {1161.68655},
     language = {en},
     url = {http://dml.mathdoc.fr/item/05493594}
}

Di Giacomo, Emilio; Didimo, Walter; Liotta, Giuseppe; Meijer, Henk; Trotta, Francesco; Wismath, Stephen K. k-colored point-set embeddability of outerplanar graphs.. Journal of Graph Algorithms and Applications, Tome 12 (2008) pp. 29-49. http://gdmltest.u-ga.fr/item/05493594/