k-colored Point-set Embeddability of Outerplanar Graphs

DOI10.7155/JGAA.00158MaRDI QIDQ5301427zbMATHOpenAlexFDO

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

Publication date 19 January 2009

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/55404

zbMATH Keywords

drawing algorithms

Mathematics Subject Classification ID

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

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
• Constrained point-set embeddability of planar graphs

Cited in

(16)

• Upward point set embeddability for convex point sets is in P
• Drawing colored graphs with constrained vertex positions and few bends per edge
• On upward point set embeddability
• Colored Point-Set Embeddings of Acyclic Graphs
• The point-set embeddability problem for plane graphs
• Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge
• Constrained Point-Set Embeddability of Planar Graphs
• k-Colored Point-Set Embeddability of Outerplanar Graphs
• Drawing Colored Graphs on Colored Points
• Simultaneous embedding of colored graphs
• 2-colored point-set embeddings of partial 2-trees
• Alternating paths and cycles of minimum length
• 2-colored point-set embeddings of partial 2-trees
• Embedding k-Outerplanar Graphs into l1
• On the curve complexity of 3-colored point-set embeddings
• Improved algorithms for the point-set embeddability problem for plane 3-trees

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 Q5301427)