Singly-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.
| Identifer | oai:union.ndltd.org:uvic.ca/oai:dspace.library.uvic.ca:1828/2117 |
| Date | 26 January 2010 |
| Creators | Smith, Bethany Joy |
| Contributors | MacGillivray, Gary |
| Source Sets | University of Victoria |
| Language | English, English |
| Detected Language | English |
| Type | Thesis |
| Rights | Available to the World Wide Web |
Page generated in 0.002 seconds