Nodally 3-connected planar graphs and convex combination mappings

Simple item page
dc.creatorDunlaing, Colm O
dc.date2007-08-07
dc.date.accessioned2026-07-07T08:22:36Z
dc.date.available2026-07-07T08:22:36Z
dc.descriptionA 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.
dc.description27 pages Latex, 11 postscript figures
dc.identifierhttps://arxiv.org/abs/0708.0964
dc.identifierhttp://arxiv.org/abs/0708.0964
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/135708
dc.subjectComputational Geometry
dc.titleNodally 3-connected planar graphs and convex combination mappings
dc.typetext

Files

Collections

arXiv