University of Victoria (Canada)
Components and colourings of singly- and doubly-periodic graphs
Abstract
dc:description.abstractSingly-periodic (SP) and doubly-periodic (DP) graphs arc infinite graphs which have translational symmetries in one and two dimensions, respectively. The problem of counting the number of connected components in such graphs is investigated. A method for determining whether or not an SP graph is k-colourable for a given positive integer k is given, and the question of deciding k-colourability of DP graphs is discussed. Colourings of SP and DP graphs can themselves be either periodic or aperiodic, and properties which determine the symmetries of their colourings arc also explored.
Degree
thesis:*- Level thesis:degree_level
- Master of Science M.Sc.
- Department thesis:degree_department
- Department of Mathematics and Statistics
- Year dc:date.issued
- 2010
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Smith, Bethany Joy
- Advisor dc:contributor.supervisor
-
- MacGillivray, Gary
Subjects
dc:subject × 3Rights
dc:rights- Statement dc:rights
-
- Available to the World Wide Web
- Language dc:language.iso
- en, English
Identifiers
dc:identifier.*- Handle dc:identifier.uri
- http://hdl.handle.net/1828/2117