Universal pointsets for 2-coloured trees

DOI10.1007/978-3-642-18469-7_33zbMATH Open1314.68242DBLPconf/gd/GarderenLM10OpenAlexW1602968311WikidataQ62042503 ScholiaQ62042503MaRDI QIDQ3073687FDOQ3073687

Authors: Mereke Van Garderen, Giuseppe Liotta, Henk Meijer 

Publication date: 11 February 2011

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

Full work available at URL: https://doi.org/10.1007/978-3-642-18469-7_33

Recommendations

• Universal point sets for 2-coloured trees
• Point-set embeddability of 2-colored trees
• Colored simultaneous geometric embeddings and universal pointsets
• Bichromatic point-set embeddings of trees with fewer bends (extended abstract)
• Colored Simultaneous Geometric Embeddings

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) Coloring of graphs and hypergraphs (05C15)

Cited In (5)

• Colored Simultaneous Geometric Embeddings
• Colored simultaneous geometric embeddings and universal pointsets
• Universal point sets for 2-coloured trees
• Universal sets for straight-line embeddings of bicolored graphs
• Point-set embeddability of 2-colored trees

This page was built for publication: Universal pointsets for 2-coloured trees

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