Back to search

University of York

An evaluation on the gracefulness and colouring of graphs

Abstract

dc:description.abstract

In this thesis we shall introduce two interesting topics from graph theory and begin to explore what happens when we combine these together. We will be focusing on an area known as graph colouring and assessing it alongside a very unique set of graphs called graceful graphs. The two topic areas, although not mixed together often, nicely support each other in introducing various findings from each of the topics. We will start by investigating graceful graphs and determining what classes of graph can be deemed to be graceful, before introducing some of the fundamentals of graph colouring. Following this we can then begin to investigate the two topics combined and will see a whole range of results, including some fascinating less well known discoveries. Furthermore, we will introduce some different types of graph colouring based off the properties of graceful graphs. Later in the thesis there will also be a focus on tree graphs, as they have had a huge influence on research involving graceful graphs over the years. We will then conclude by investigating some results that have been formulated by combining graceful graphs with a type of graph colouring known as total colouring.

Degree

thesis:*
Name dc:type.qualificationname
M.Sc by research
Level dc:type.qualificationlevel
masters
Grantor dc:publisher.institution
University of York
Year dc:date.issued
2017

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Dhami, Kymrun K.
Advisor dc:contributor.advisor
  • Ferguson, David

Rights

Language dc:language.dcterms_iso639_2
eng

Chain of custody

source
Harvested from
White Rose University Consortium
Base URL
etheses.whiterose.ac.uk/cgi/oai2
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
related terms
citation

Dhami, Kymrun K.. An evaluation on the gracefulness and colouring of graphs. masters thesis, University of York, 2017.