Constrained Point-Set Embeddability of Planar Graphs

DOI10.1007/978-3-642-00219-9_35zbMath1213.68438OpenAlexW1561232697MaRDI QIDQ3611871

Giuseppe Liotta, Walter Didimo, Emilio Di Giacomo, Henk G. Meijer, Stephen K. Wismath

Publication date: 3 March 2009

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00219-9_35

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• Curve-constrained drawings of planar graphs
• Drawing colored graphs on colored points
• On the thickness of graphs of given degree
• The rooted tree embedding problem into points in the plane
• On embedding an outer-planar graph in a point set
• Straight line embeddings of rooted star forests in the plane
• Optimal Algorithms to Embed Trees in a Point Set
• Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
• Graph Drawing and Applications for Software and Knowledge Engineers
• k-colored Point-set Embeddability of Outerplanar Graphs
• Point-Set Embedding of Trees with Edge Constraints
• Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge
• ON EMBEDDING A GRAPH ON TWO SETS OF POINTS
• SEMI-BALANCED PARTITIONS OF TWO SETS OF POINTS AND EMBEDDINGS OF ROOTED FORESTS
• Embedding planar graphs at fixed vertex locations

This page was built for publication: Constrained Point-Set Embeddability of Planar Graphs