Drawing colored graphs on colored points

DOI10.1016/j.tcs.2008.08.004zbMath1157.68051OpenAlexW2063120809WikidataQ62042555 ScholiaQ62042555MaRDI QIDQ959802

Giuseppe Liotta, Emilio Di Giacomo, Melanie Badent

Publication date: 12 December 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.08.004

zbMATH Keywords

computational geometrygraph drawingpoint-set embeddinggraph Hamiltonicity

Mathematics Subject Classification ID

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)

Related Items (23)

A new algorithm for embedding plane graphs at fixed vertex locations ⋮ Relating Graph Thickness to Planar Layers and Bend Complexity ⋮ Alternating paths and cycles of minimum length ⋮ Orthogeodesic point-set embedding of trees ⋮ Orthogeodesic Point-Set Embedding of Trees ⋮ Upward Point Set Embeddability for Convex Point Sets Is in P ⋮ Upward book embeddability of \(st\)-graphs: complexity and algorithms ⋮ Small Point-Sets Supporting Graph Stories ⋮ Small point-sets supporting graph stories ⋮ On upward point set embeddability ⋮ Colored anchored visibility representations in 2D and 3D space ⋮ On the curve complexity of 3-colored point-set embeddings ⋮ Colored Point-Set Embeddings of Acyclic Graphs ⋮ \(\beta\)-stars or on extending a drawing of a connected subgraph ⋮ Computing upward topological book embeddings of upward planar digraphs ⋮ CONSTRAINED POINT-SET EMBEDDABILITY OF PLANAR GRAPHS ⋮ Constrained Point-Set Embeddability of Planar Graphs ⋮ 2-colored point-set embeddings of partial 2-trees ⋮ 2-colored point-set embeddings of partial 2-trees ⋮ Upward Book Embeddings of st-Graphs ⋮ Planar straight-line point-set embedding of trees with partial embeddings ⋮ Planar drawings of fixed-mobile bigraphs ⋮ THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE GRAPHS

Cites Work

• Unnamed Item
• Curve-constrained drawings of planar graphs
• On the thickness of graphs of given degree
• Network analysis. Methodological foundations.
• k-Colored Point-Set Embeddability of Outerplanar Graphs
• Drawing Colored Graphs on Colored Points
• Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
• Graph Drawing and Applications for Software and Knowledge Engineers
• Embedding Graphs into a Three Page Book with O(m log n) Crossings of Edges over the Spine
• ON EMBEDDING A GRAPH ON TWO SETS OF POINTS
• Drawing graphs. Methods and models
• Embedding planar graphs at fixed vertex locations

This page was built for publication: Drawing colored graphs on colored points