Drawing Colored Graphs on Colored Points
DOI10.1007/978-3-540-73951-7_10zbMATH Open1209.05061OpenAlexW2161240755MaRDI QIDQ3603518FDOQ3603518
Authors: Melanie Badent, Emilio Di Giacomo, Giuseppe Liotta 
Publication date: 17 February 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73951-7_10
Recommendations
- Drawing colored graphs on colored points
- k-Colored Point-Set Embeddability of Outerplanar Graphs
- k-colored Point-set Embeddability of Outerplanar Graphs
- Drawing colored graphs with constrained vertex positions and few bends per edge
- Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cited In (8)
- Bounds for point recolouring in geometric graphs
- k-Colored Point-Set Embeddability of Outerplanar Graphs
- Embeddability Problems for Upward Planar Digraphs
- Point-set embeddings of trees with given partial drawings
- Improved algorithms for the point-set embeddability problem for plane 3-trees
- Drawing colored graphs on colored points
- Drawing colored graphs with constrained vertex positions and few bends per edge
- Coloring drawings of bipartite graphs: A problem in automated assembly
This page was built for publication: Drawing Colored Graphs on Colored Points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3603518)
