Universal point sets for 2-coloured trees
DOI10.1016/J.IPL.2012.01.009zbMATH Open1243.05089OpenAlexW1983005350WikidataQ62042476 ScholiaQ62042476MaRDI QIDQ436323FDOQ436323
Authors: Mereke Van Garderen, Giuseppe Liotta, Henk Meijer 
Publication date: 20 July 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2012.01.009
Recommendations
Trees (05C05) 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) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- A better upper bound on the number of triangulations of a planar point set
- Straight-line embeddings of two rooted trees in the plane
- Bipartite embeddings of trees in the plane
- Straight line embeddings of rooted star forests in the plane
- Title not available (Why is that?)
- SEMI-BALANCED PARTITIONS OF TWO SETS OF POINTS AND EMBEDDINGS OF ROOTED FORESTS
- Point-set embeddings of trees with given partial drawings
- The rooted tree embedding problem into points in the plane
- Colored simultaneous geometric embeddings and universal pointsets
Cited In (6)
This page was built for publication: Universal point sets for 2-coloured trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436323)
