Point-set embeddability of 2-colored trees

DOI10.1007/978-3-642-36763-2_26MaRDI QIDQ4912211zbMATH OpenOpenAlexWikidataFDO

Authors Fabrizio Frati, Marc Glisse, Giuseppe Liotta, Tamara Mchedlidze, Rahnuma Islam Nishat, William Lenhart

Publication date 3 April 2013

Published in Graph Drawing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-36763-2_26

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Bichromatic point-set embeddings of trees with fewer bends (extended abstract)
• 2-colored point-set embeddings of partial 2-trees
• Universal point sets for 2-coloured trees
• 2-colored point-set embeddings of partial 2-trees
• Universal pointsets for 2-coloured trees

Cited in

(14)

• On L-shaped point set embeddings of trees: first non-embeddable examples
• Colored anchored visibility representations in 2D and 3D space
• On the curve complexity of 3-colored point-set embeddings
• Universal sets for straight-line embeddings of bicolored graphs
• The point-set embeddability problem for plane graphs
• On embeddability of buses in point sets
• Universal pointsets for 2-coloured trees
• Alternating paths and cycles of minimum length
• Universal point sets for 2-coloured trees
• Colored Point-Set Embeddings of Acyclic Graphs
• ON EMBEDDING A GRAPH ON TWO SETS OF POINTS
• Bichromatic point-set embeddings of trees with fewer bends (extended abstract)
• 2-colored point-set embeddings of partial 2-trees
• 2-colored point-set embeddings of partial 2-trees

This page was built for publication: Point-set embeddability of 2-colored trees

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