k-Colored Point-Set Embeddability of Outerplanar Graphs

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

Giuseppe Liotta, Walter Didimo, Emilio Di Giacomo, Stephen K. Wismath, Francesco Trotta, 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

68R10: Graph theory (including graph drawing) in computer science

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

05C10: Planar graphs; geometric and topological aspects of graph theory

05C85: Graph algorithms (graph-theoretic aspects)

Related Items

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