k-Colored Point-Set Embeddability of Outerplanar Graphs

DOI10.1007/978-3-540-70904-6_31zbMath1185.68465OpenAlexW2051571646MaRDI QIDQ3595463

Giuseppe Liotta, Walter Didimo, Francesco Trotta, Emilio Di Giacomo, Stephen K. Wismath, Henk G. Meijer

Publication date: 28 August 2007

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70904-6_31

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Point-set embeddings of trees with given partial drawings ⋮ Drawing colored graphs on colored points

This page was built for publication: k-Colored Point-Set Embeddability of Outerplanar Graphs