Components and colourings of singly- and doubly-periodic graphs

Files

Smith_B_MSc.pdf (31.89 MB)

Date

2010-01-26T22:48:26Z

Authors

Smith, Bethany Joy

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

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.

Description

Keywords

graph theory, graph coloring

Citation

URI

http://hdl.handle.net/1828/2117

Collections

ETD (Electronic Theses and Dissertations)
Theses (Mathematics and Statistics)
 
University of Victoria Libraries

We acknowledge and respect the Lək̓ʷəŋən (Songhees and Esquimalt) Peoples on whose territory the university stands, and the Lək̓ʷəŋən and W̱SÁNEĆ Peoples whose historical relationships with the land continue to this day.