In graph drawing, a universal point set of order n is a set S of points in the Euclidean plane with the property that every n-vertex planar graph hasâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2015

2015

- Patrizio Angelini, Till Bruckdorfer, Michael Kaufmann, Tamara Mchedlidze
- Graph Drawing
- 2015

A point set S âŠ† R is universal for a class G if every graph of G has a planar straight-line embedding on S. It is well-known thatâ€¦Â (More)

Is this relevant?

Review

2013

Review

2013

- Michael J. Bannister, Zhanpeng Cheng, William E. Devanny, David Eppstein
- Graph Drawing
- 2013

An old open problem in graph drawing asks for the size of a universal point set, a set of points that can be used as vertices forâ€¦Â (More)

Is this relevant?

2012

2012

- Jean Cardinal, Michael Hoffmann, Vincent Kusters
- TJJCCGG
- 2012

A set P of points in R is n-universal, if every planar graph on n vertices admits a plane straight-line embedding on P. Answeringâ€¦Â (More)

Is this relevant?

2012

2012

- Fabrizio Frati, Marc Glisse, William J. Lenhart, Giuseppe Liotta, Tamara Mchedlidze, Rahnuma Islam Nishat
- Graph Drawing
- 2012

In this paper we study bichromatic point-set embeddings of 2-colored trees on 2-colored point sets, i.e., point-set embeddings ofâ€¦Â (More)

Is this relevant?

2011

2011

- Vida Dujmovic, William S. Evans, +4 authors Stephen K. Wismath
- Graph Drawing
- 2011

Article history: Received 14 October 2011 Accepted 27 March 2012 Available online xxxx Communicated by D. WagnerÂ

Is this relevant?

2011

2011

- Patrizio Angelini, Giuseppe Di Battista, Michael Kaufmann, Tamara Mchedlidze, Vincenzo Roselli, Claudio Squarcella
- Graph Drawing
- 2011

A point set P âŠ† R is universal for a class G if every graph of G has a planar straight-line embedding into P . We prove thatâ€¦Â (More)

Is this relevant?