Nodally 3-connected planar graphs and convex combination mappings

Details Nodally 3-connected planar graphs and convex combination mappings Nodally 3-connected planar graphs and convex combination mappings

2007-08-07

arxiv.org/abs/0708.0964v1

Computer Science

Computational Geometry

27 pages Latex, 11 postscript figures

Scientific paper

A convex combination mapping of a planar graph is a plane mapping in which the external vertices are mapped to the corners of a convex polygon and every internal vertex is a proper weighted average of its neighbours. If a planar graph is nodally 3-connected or triangulated then every such mapping is an embedding (Tutte, Floater). We give a simple characterisation of nodally 3-connected planar graphs, and generalise the above result to any planar graph which admits any convex embedding.

Affiliated with

Also associated with

No associations

Rating

Nodally 3-connected planar graphs and convex combination mappings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Nodally 3-connected planar graphs and convex combination mappings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Nodally 3-connected planar graphs and convex combination mappings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-170719