The Open UniversitySkip to content
 

Sewing ribbons on graphs in space

Archdeacon, D.; Bonnington, P.; Richter, B. and Siran, J. (2002). Sewing ribbons on graphs in space. Journal of Combinatorial Theory, Series B, 86(1) pp. 1–26.

DOI (Digital Object Identifier) Link: http://dx.doi.org/10.1006/jctb.2002.2076
Google Scholar: Look up in Google Scholar

Abstract

An open ribbon is a square with one side called the seam. A closed ribbon is a cylinder with one boundary component called the seam. We sew an open (resp. closed) ribbon onto a graph by identifying the seam with an open (resp. closed) walk in the graph. A ribbon complex is a graph with a finite number of ribbons sewn on. We investigate when a ribbon complex embeds in 3-dimensional Euclidean space. We give several characterizations of such spatial complexes which lead to algorithms. We examine special cases where (1) each edge of the graph is incident with at most three ribbons, and (2) every ribbon is closed together with a connectivity condition.

Item Type: Journal Article
ISSN: 0095-8956
Academic Unit/Department: Mathematics, Computing and Technology > Mathematics and Statistics
Item ID: 8092
Depositing User: Jozef Širáň
Date Deposited: 14 Jun 2007
Last Modified: 02 Dec 2010 20:00
URI: http://oro.open.ac.uk/id/eprint/8092
Share this page:

Actions (login may be required)

View Item
Report issue / request change

Policies | Disclaimer

© The Open University   + 44 (0)870 333 4340   general-enquiries@open.ac.uk