Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge

DOI10.1007/978-3-540-77537-9_31MaRDI QIDQ5452234zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Emilio Di Giacomo, Giuseppe Liotta, Francesco Trotta

Publication date 25 March 2008

Published in Graph Drawing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-77537-9_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) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• Drawing colored graphs with constrained vertex positions and few bends per edge
• 2-colored point-set embeddings of partial 2-trees
• Drawing colored graphs on colored points
• k-colored Point-set Embeddability of Outerplanar Graphs
• k-Colored Point-Set Embeddability of Outerplanar Graphs

Cited in

(10)

• Graph Drawing
• k-Colored Point-Set Embeddability of Outerplanar Graphs
• Drawing Colored Graphs on Colored Points
• \(k\)-spine, 1-bend planarity
• k-colored Point-set Embeddability of Outerplanar Graphs
• Constrained Point-Set Embeddability of Planar Graphs
• Drawing colored graphs on colored points
• Drawing colored graphs with constrained vertex positions and few bends per edge
• Choosing Colors for Geometric Graphs Via Color Space Embeddings
• Drawing Simultaneously Embedded Graphs with Few Bends

This page was built for publication: Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge

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