Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Nesting points in the sphere Dan Archdeacon
 

Summary: Nesting points in the sphere
Dan Archdeacon
Dept. of Computer Science
University of Vermont
Burlington, VT, USA 05405
e-mail: dan.archdeacon@uvm.edu
Feliu Sagols
Dept. of Computer Science
University of Vermont
Burlington, VT, USA 05405
e-mail: fsagols@emba.uvm.edu 1
July 26, 1999 (revised June 14, 2000)
Abstract
Let G be a graph embedded in the sphere. A k-nest of a point x
not in G is a collection C 1 ; : : : ; C k
of disjoint cycles such that for each
C i , the side containing x also contains C j for each j < i. An embedded
graph is k-nested if each point not on the graph has a k-nest. In this
paper we examine k-nested maps. We nd the minor-minimal k-nested
maps small values of k. In particular, we nd the obstructions (under

  

Source: Archdeacon, Dan - Department of Mathematics and Statistics, University of Vermont

 

Collections: Mathematics