k-colored Point-set Embeddability of Outerplanar Graphs
From MaRDI portal
Publication:5301427
DOI10.7155/JGAA.00158zbMATH Open1161.68655OpenAlexW2162161033MaRDI QIDQ5301427FDOQ5301427
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
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)
- Colored Point-Set Embeddings of Acyclic Graphs
- 2-colored point-set embeddings of partial 2-trees
- Planar drawings of fixed-mobile bigraphs
- Upward point set embeddability for convex point sets is in P
- Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge
- k-Colored Point-Set Embeddability of Outerplanar Graphs
- Drawing Colored Graphs on Colored Points
- On upward point set embeddability
- 2-colored point-set embeddings of partial 2-trees
- Simultaneous embedding of colored graphs
- On the curve complexity of 3-colored point-set embeddings
- Embedding k-Outerplanar Graphs into l1
- Alternating paths and cycles of minimum length
- Constrained Point-Set Embeddability of Planar Graphs
- The point-set embeddability problem for plane graphs
- Improved algorithms for the point-set embeddability problem for plane 3-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)
