Back to search

The Open University

Edge-colourings of graphs

Abstract

dc:description.abstract

All the results in this thesis are concerned with the classification of graphs by their chromatic class. We first extend earlier results of Fiorini and others to give a complete list of critical graphs of order at most ten. We give conditions for extending the edge-colouring of a nearly complete subgraph to the whole graph and use this result to prove a special case of Vizing's conjecture. We also use other methods to solve further cases of this conjecture. A major part of the thesis classifies those graphs with at most 4 vertices of maximum degree and this work is generalised to graphs with r vertices of maximum degree. We also completely classify all regular graphs G with degree at least 6/7|V(G)|. Finally we give some examples of even order critical graphs and introduce the concept of a supersnark.

Degree

thesis:*
Name dc:type.qualificationname
phd
Level dc:type.qualificationlevel
doctoral
Grantor dc:publisher.institution
The Open University
Year dc:date.issued
1984

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Chetwynd, Amanda Gillian

Rights

Language dc:language
en

Chain of custody

source
Harvested from
The Open University
Base URL
oro.open.ac.uk/cgi/oai2
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Chetwynd, Amanda Gillian. Edge-colourings of graphs. doctoral thesis, The Open University, 1984.