By Topic

Planarity testing for graphs represented by a rotation scheme

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
A. Donafee ; Fac. of Creative Arts & Technol., Univ. of Luton, UK ; C. Maple

Many algorithms exist to determine if a given graph can be embedded in a plane [G. Di Battistia et al., (1994)]. The majority of these methods, however, are only valid for simple graphs and do not take into account the order of edges emanating from each vertex. There are many areas, such as communication design, genetics, group theory, network optimisation and VLSI, where the ordering of edges is crucial to the representation of a system. Rotation schemes can be used to store the ordering of edges around a vertex. Let G be an arbitrary, possibly nonsimple, graph. We provide an algorithm that determines, from the rotation scheme of G, if G can be embedded in the plane. If the rotation scheme of G can be realised by a planar drawing, the regions of G are returned.

Published in:

Information Visualization, 2003. IV 2003. Proceedings. Seventh International Conference on

Date of Conference:

16-18 July 2003