k-colored Point-set Embeddability of Outerplanar Graphs
From MaRDI portal
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
(17)- On upward point set embeddability
- Simultaneous embedding of colored graphs
- On the curve complexity of 3-colored point-set embeddings
- The point-set embeddability problem for plane graphs
- Improved algorithms for the point-set embeddability problem for plane 3-trees
- Upward point set embeddability for convex point sets is in P
- Alternating paths and cycles of minimum length
- k-Colored Point-Set Embeddability of Outerplanar Graphs
- Drawing Colored Graphs on Colored Points
- Constrained Point-Set Embeddability of Planar Graphs
- Colored Point-Set Embeddings of Acyclic Graphs
- Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge
- Embedding k-Outerplanar Graphs into l1
- 2-colored point-set embeddings of partial 2-trees
- 2-colored point-set embeddings of partial 2-trees
- A linear-time approximation algorithm for the minimum-length geometric embedding of trees
- 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 Q5301427)
