k-Colored Point-Set Embeddability of Outerplanar Graphs

DOI10.1007/978-3-540-70904-6_31MaRDI QIDQ3595463zbMATH OpenOpenAlexFDO

Authors Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Francesco Trotta, Henk Meijer, S. Wismath

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 algorithms (graph-theoretic aspects) (05C85) 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)

Recommendations

• k-colored Point-set Embeddability of Outerplanar Graphs
• Drawing colored graphs on colored points
• Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge
• Drawing colored graphs with constrained vertex positions and few bends per edge
• Drawing Colored Graphs on Colored Points

Cited in

(11)

• Colored Point-Set Embeddings of Acyclic Graphs
• 2-colored point-set embeddings of partial 2-trees
• Drawing Colored Graphs on Colored Points
• Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge
• 2-colored point-set embeddings of partial 2-trees
• On the curve complexity of 3-colored point-set embeddings
• Embedding k-Outerplanar Graphs into l1
• k-colored Point-set Embeddability of Outerplanar Graphs
• Point-set embeddings of trees with given partial drawings
• Drawing colored graphs on colored points
• Drawing colored graphs with constrained vertex positions and few bends per edge

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3595463)